Abstract
P2P systems have emerged as a popular way to share huge volumes of data. It offers many attractive features, such as autonomy, load balancing, availability and anonymity. However, it also faces some serious challenges, such as poor scalability and low efficiency. This paper propose a new distributed P2P network model of ECHP2P withhierarchical structure based on cluster, with ECHP2P, peers are grouped into clusters according to proximity, and super peers are selected from regular peers to act as cluster leaders. These leaders are connected to each other, forming a backbone overlay network. To manage the routing and to limit duplicate messages on it, we propose an application level route strategy: Optimized-Flooding. Simulation results about ECHP2P system show that it could effectively solve the above problems, and larger the network size is, more efficient its comprehensive performance is, so the model is reasonable and effective.
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.
Similar content being viewed by others
References
Parameswaran, M., Susarla, A., Whinston, A.B.: P2P networking: An information-sharing alternative. Computing Practices 34(7), 31–38 (2001)
Ratnasamy, S., Francis, P., Handley, M., Kasuperpeer, R., Shenker, S.: A Scalable Content-Addressable Network. In: ACM SIGCOMM, pp. 161–172 (August 2001)
Rowstron, A., Druschel, P.: Pastry: Scalable, Distributed Object Location and Routing for Large-Scale Peer-to-Peer Systems. In: Proceedings of the IFIP/ACM International Conference on Distributed Systems Platforms (Middleware 2001) (November 2001)
Stoica, I., Morris, R., Karger, D., Kaashoek, M.F., Balakrishnan, H.: Chord: A Scalable Peer-to-Peer Lookup Service for Internet Applications. In: ACM SIGCOMM, August 2001, pp. 149–160 (2001)
Zhao, B.Y., Kubiatowicz, J.D., Joseph, A.D.: Tapestry: An Infrastructure for Fault-Tolerant Wide-Area Location and Routing. Technical Report UCB/CSD-01-1141 (April 2000)
Yang, B., Garcia-Molina, H.: Efficient Search in Peer-to-Peer Networks (2004-12-10), http://www.cs.utexas.edu/users/browne/CS395Tf2002/Papers/GarciaMolina-showDoc.pdf/
Li, J., Vuong, S.: An Efficient Clustered Architecture for P2P Networks. In: Proceedings of the 18th International Conference on Advanced Informatin networking and Application (AINA 2004) (2004)
Gnutella website, http://gnutella.wego.com/2004-12-10
Clarke, I., Sandberg, O., Wiley, B., Hong, T.W.: Freenet: A distributed anonymous information storage and retrieval system, http://www.doc.ic.ac.uk/~twh1/academic/papers/icsi-revised.pdf/2004-12-10
Traversat, B., Arora, A., Abdelaziz, M., Duigou, M., Haywood, C., Hugly, J.-C., Pouyoul, E., Yeager, B.: Project JXTA 2.0 Super-Peer Virtual Network, http://www.jxta.org/project/www/docs/JXTA2.0protocols1.pdf/2004-12-10
Super-Peer Architectures for Distributed Computing, http://www.fiorano.com/whitepapers/supesuperpeereer.pdf/2004-12-10
Rekhter, Y., Li, T.: A Border Gateway Protocol 4 (BGP-4). RFC 1654, Internet Engineering Task Force (July 1994)
Banerjee, S., Bhattacharje, B., Kommareddy, C.: Scalable Application Layer Multicast, http://www.cs.unc.edu/Courses/comp249-s05/readings/nice-appmulti.pdf/2004-12-10
Kleinberg, J.: The Small-World phenomenon: An algorithmic perspective. In: ACM Symp. on Theory of Computing (2000)
Kempe, D., Kleinberg, J., Demers, A.: Spatial gossip and resource location protocols. In: Proc of the 33rd ACM Symp on Theory of computing, Crete, Greece (2001)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2005 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Yue, G., Li, R., Zhou, Z., Wu, R. (2005). An Efficient Cluster-Hierarchy Architecture Model ECHP2P for P2P Networks. In: Zhuge, H., Fox, G.C. (eds) Grid and Cooperative Computing - GCC 2005. GCC 2005. Lecture Notes in Computer Science, vol 3795. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11590354_98
Download citation
DOI: https://doi.org/10.1007/11590354_98
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-30510-1
Online ISBN: 978-3-540-32277-1
eBook Packages: Computer ScienceComputer Science (R0)