Abstract
Recently superpeers are introduced to improve the performance of P2P systems. A superpeer is a node in a P2P system that operates as a server for a set of clients. By exploiting heterogeneity, the superpeer paradigm allows P2P systems to run more efficiently. This paper proposes a hierarchy-adaptive P2P topology DAHP2P and a hierarchical routing algorithm Hroute. Peers are grouped into clusters according to proximity and super peers form the upper-level overlay, the number of hierarchy is self-adaptively changed according to the number of nodes in the system, a hierarchical routing algorithm is designed to reduce the routing hops. Simulation results show that Hroute can significantly reduce the expected number of hops and latency of message routing, and loads of peers at different layers are relatively balanceable.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Stoica, I., Morris, R., Karger, D., Kaashoek, M., Balakrishnan, H.: Chord: A scalable peer-to-peer lookup service for internet applications. In: Proceedings of SIGCOMM (2001)
Ratnasamy, S., Handley, M., Karp, R., Shenker, S.: A scalable content-addressable network. In: Proceedings of SIGCOMM (2001)
Rowstron, Druschel, P.: Pastry: Scalable, distributed object location and routing for large-scale peer-to-peer systems. In: IFIP/ACM International Conference on Distributed Systems Platforms (Middleware) (Heidelberg, Germany), pp. 329–350 (November 2001)
Zhao, B.Y., Kubiatowicz, J., Joseph, A.D.: Tapestry: An infrastructure for fault-tolerant wide-area location and routing. Tech. Rep. UCB/CSD-01-1141, Computer Science Division, University of California, Berkeley (2001)
Ripeanu, M., Ian Foster, T.: Mapping the gnutella network: Macroscopic properties of large-scale peer-to-peer systems. In: Revised Papers from the First International Workshop on Peer-to-Peer Systems, pp. 85–93. Springer, Heidelberg (2002)
Yang, B., Garcia-Molina, H.: Designing a super-peer network. In: Proceedings of the 19th International conference on Data Engineering (2003)
Montresor, A.: A robust protocol for building superpeer overlay topologies. In: Proceedings of the 4 International Conference on P2P Computing, Zurich, Switzerland, pp. 202–209. IEEE Computer Society, Los Alamitos (2004)
Kazaa: Kazaa home page (2003), http://www.kazaa.com/
Gnutella, http://www.gnutella.com
Kaashoek, F., David, K., Koorde, R.: A simple degree-optimal hash table. A simple degree optimal distributed hash table. In: Proceedings of the 2nd International Workshop on P2P Systems(IPIPS 2003), Berkeley, CA, pp. 98–107 (2003)
Singla, A., Rohrs, C.: Ultrapeers: Another step towards gnutella scalability. Whitepaper (2002)
Zhao, B.Y., Duan, Y., Huang, L., Joseph, A.D., Kubiatowicz, J.D.: Brocade: Landmark routing on overlay networks. In: Proceedings of IPTPS 2002, Cambridge, MA (2002)
Ng, T.S.E., Zhang, H.: Predicting Internet network distance with coordinates-based approaches. In: Proceedings of IEEE Infocom, pp. 170–179. IEEE Computer Society Press, Los Alamitos (2002)
Medina, A., Lakhina, A., Matta, I., And Byers, J.: BRITE: An Approach to Universal Topology Generation. In: Proceedings of MASCOTS 2001, Cincinnati. OH (2001)
Xu, Z., Zhang, Z.: Building Low-maintenance Expressways for P2P Systems. Hewlett-Packard Labs, Palo Alto, CA, Tech. Rep. HPL-2002- 41 (2002)
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 2007 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Zhang, XM., Wang, YJ., Li, Z. (2007). Research of Routing Algorithm in Hierarchy-Adaptive P2P Systems. In: Stojmenovic, I., Thulasiram, R.K., Yang, L.T., Jia, W., Guo, M., de Mello, R.F. (eds) Parallel and Distributed Processing and Applications. ISPA 2007. Lecture Notes in Computer Science, vol 4742. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-74742-0_65
Download citation
DOI: https://doi.org/10.1007/978-3-540-74742-0_65
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-74741-3
Online ISBN: 978-3-540-74742-0
eBook Packages: Computer ScienceComputer Science (R0)