Abstract
This chapter provides an overview of structured Peer-to-Peer overlay algorithms. The chapter introduces basic concepts including geometries, routing algorithms, routing table maintenance, node join/leave behaviour, and bootstrapping of structured Peer-to-Peer overlay algorithms. Based on these key concepts, a number of key overlay algorithms are classified into categories and a brief over-view of these algorithms is presented. Finally, the chapter presents an ’on-a-glance’ comparison of the presented algorithms and provides an outlook on open research issues.
Access provided by Autonomous University of Puebla. Download to read the full chapter text
Chapter PDF
Similar content being viewed by others
Keywords
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
References
S. Androutsellis-Theotokis, D. Spinellis. A Survey of Content Distribution Technolgies. ACM Computing Surveys, Vol. 36, No. 4, December 2004.
E. K. Lua, J. Crowcroft, M. Pias, R. Sharma, S. Lim. A Survey and Comparison of Peer-to-Peer Overlay Network Schemes. IEEE Communications Surveys and Tutorials, Second Quarter 2005, Volume 7, No. 2.
J. Risson, T. Moors. Survey of research towards robust peer-to-peer networks: search methods. Computer Networks 50, 17 (Dec. 2006), 3485-3521.
S. El-Ansary, S. Haridi. An Overview of Structured P2P Overlay Networks. Handbook on Theoretical and Algorithmic Aspects of Sensor, Ad Hoc Wireless, and Peer-to-Peer Networks (ed. J. Wu). Auerbach Publications, 2006, pp. 665-683.
A. Gupta, B. Liskov, R. Rodrigues. Efficient routing for peer-to-peer overlays. Proceedings of the 1st Symposium on Networked Systems Design and Implementation (NSDI 2004), 2004, pp. 113-116.
J. Buford, A. Brown, M. Kolberg. Exploiting Parallelism in the Design of Peer-to-Peer Overlays. Journal of Computer Communications, Special Issue on Foundations of Peer-to-Peer Computing. 2008.
M. Kolberg, F. Kolberg, A. Brown, J. Buford. A Markov Model for the EpiChord Peer-to-Peer Overlay in an XCAST enabled Network. IEEE International Conference on Communications (ICC) 2007.
I. Stoica, R. Morris, D. Liben-Nowell, D. R. Karger, M. F. Kaashoek, F. Dabek, H. Balakrishnan. Chord: a scalable peer-to-peer lookup protocol for internet applications. IEEE/ACM Trans. Netw. 11, 1 (Feb.2003), 17-32.
B. Leong, B. Liskov, E. D. Demaine. EpiChord: Parallelizing the Chord Lookup Algorithm with Reactive Routing State Management. Computer Communications, Elsevier Science, Vol. 29, pp. 1243-1259.
P. Maymounkov, D. Mazieres. Kademlia: A peer-to-peer information system based on the XOR metric. In Proc of IPTPS02, Cambridge, USA, March 2002.
R. Sylvia, F. Paul, H. Mark, K. Richard, S. Scott. A scalable content-addressable network, Proceedings of the 2001 conference on Applications, technologies, architectures, and protocols for computer communications, p.161-172, August 2001, San Diego, California, United States.
S. Krishnamurthy, S. El-Ansary, E. Aurell, S. Haridi. A statistical theory of Chord under churn. In: The 4th International Workshop on Peer-to-Peer Systems (IPTPS’05).
A. I. T. Rowstron, P. Druschel. Pastry: Scalable, Decentralized Object Location, and Routing for Large-Scale Peer-to-Peer Systems, Proceedings of the IFIP/ACM International Conference on Distributed Systems Platforms Heidelberg, p.329-350, November 12-16, 2001.
M. Castro, P. Druschel, A-M. Kermarrec, A. Rowstron. “SCRIBE: A large-scale and decentralised application-level multicast infrastructure”, IEEE Journal on Selected Areas in Communication (JSAC), Vol. 20, No, 8, October 2002.
M. Castro, M. B. Jones, A-M. Kermarrec, A. Rowstron, M. Theimer, H. Wang, A. Wolman. “An Evaluation of Scalable Application-level Multicast Built Using Peer-to-peer overlays”, Infocom 2003, San Francisco, CA, April, 2003.
M. Castro, P. Druschel, A-M. Kermarrec, A. Rowstron. “Scalable Application-level Anycast for Highly Dynamic Groups”, NGC 2003, Munich, Germany, September 2003.
A. I. Rowstron, A. Kermarrec, M. Castro, P. Druschel. SCRIBE: The Design of a Large-Scale Event Notification Infrastructure. In Proceedings of the Third international Cost264 Workshop on Networked Group Communication (November 07 - 09, 2001). J. Crowcroft and M. Hofmann, Eds. Lecture Notes In Computer Science, vol. 2233. Springer-Verlag, London, 30-43.
M. Castro, P. Druschel, Y. C. Hu, A. Rowstron. Exploiting network proximity in peer-to-peer overlay networks. In International Workshop on Future Directions in Distributed Computing (FuDiCo), June 2002.
M. Castro, P. Druschel, Y. C. Hu, A. Rowstron. “Proximity neighbor selection in tree-based structured peer-to-peer overlays”, Technical report MSR-TR-2003-52, 2003.
R. Mahajan, M. Castro, A. Rowstron. “Controlling the Cost of Reliability in Peer-to-peer Overlays”, IPTPS’03, Berkeley, CA, February 2003.
M. Castro, P. Druschel, A-M. Kermarrec, A. Rowstron, “One ring to rule them all: Service discovery and binding in structured peer-to-peer overlay networks”, SIGOPS European Workshop, France, September, 2002.
P. Druschel, A. Rowstron. PAST: A large-scale, persistent peer-to-peer storage utility. In Proc. HotOS VIII, Schloss Elmau, Germany, May 2001.
A. Rowstron, P. Druschel. Storage management and caching in PAST, a large-scale, persistent peer-to-peer storage utility. In Proc. ACM SOSP’01, Banff, Canada, Oct. 2001.
S. Iyer, A. Rowstron, P. Druschel. “SQUIRREL: A decentralized, peer-to-peer web cache”, 12th ACM Symposium on Principles of Distributed Computing (PODC 2002), Monterey, California, USA, July 2002.
M. Castro, P. Druschel, A-M. Kermarrec, A. Nandi, A. Rowstron and A. Singh. “SplitStream: High-bandwidth multicast in a cooperative environment”, SOSP’03, Lake Bolton, New York, October, 2003.
M. Castro, P. Druschel, A-M. Kermarrec, A. Nandi, A. Rowstron, A. Singh. “SplitStream: High-bandwidth content distribution in a cooperative environment”, IPTPS’03, Berkeley, CA, February, 2003.
A. Mislove, A. Post, C. Reis, P. Willmann, P. Druschel, D. Wallach, X. Bonnaire, P. Sens, J. Busca. POST: a secure, resilient, cooperative messaging system, Proc. of the 9th conference on Hot Topics in Operating Systems, pp. 11-11, Hawaii, May 2003.
T.-W. J. Ngan, D. S. Wallach, P. Druschel. “Enforcing Fair Sharing of Peer-to-Peer Resources”, IPTPS’03, Berkeley, CA, February, 2003.
Rice University, FreePastry, http://freepastry.rice.edu/
Microsoft, SimPastry/VisPastry, http://research.microsoft.com/en-us/um/people/antr/pastry/download.htm
B. Y. Zhao, L. Huang, J. Stribling, S. C. Rhea, A. D. Joseph, J. Kubiatowicz. Tapestry: A resilient globalscale overlay for service deployment, IEEE Journal on Selected Areas Communications, vol. 22, no. 1, pp. 41-53, Jan. 2004.
S. Q. Zhuang, B. Y. Zhao, A. D. Joseph, R. H. Katz, J. Kubiatowicz. Bayeux: An Architecture for Scalable and Fault-tolerant Wide-Area Data Dissemination, The 11th International Workshop on Network and Operating Systems Support for Digital Audio and Video (NOSSDAV), Port Jefferson, New York, 2001.
K. Aberer, M. Hauswirth, M. Punceva, R. Schmidt. Improving Data Access in P2P Systems, IEEE Internet Computing,6(1), January/February 2002.
K. Aberer, P. Cudré-Mauroux, A. Datta, Z. Despotovic, M. Hauswirth, M. Punceva, R. Schmidt. P-Grid: A Self-organizing Structured P2P System, SIGMOD Record, 32(2), September 2003.
K. Aberer, A. Datta, M. Hauswirth. P-Grid:Dynamics of self organization processes in structured P2P systems, Peer-to-Peer Systems and Applications, Lecture Notes in Computer Science, LNCS 3845, Springer Verlag, 2005.
A. Kumar, S. Merugu, J. Xu, E. W. Zegura, X. Yu. Ulysses: A Robust, Low-Diameter, Low-Latency Peer-to-peer Network, In European Transactions on Telecommunications (ETT) Special Issue on P2P Networking and P2P Services, 2004. Vol. 15, pages 571-587.
H.J. Siegel, Interconnection Networks for SIMD machines, Computer 12(6), 1979.
H. Shen, C.-Z. Xu, G. Chen. Cycloid: A scalable constant-degree lookup-efficient P2P overlay network, Journal of Performance Evaluation’s Special Issue on Peer-to-Peer Networks (6/29), 2005.
I. Gupta, K. Birman, P. Linga, A. Demers, R. van Renesse. Kelips: building an efficient and stable P2P DHT through increased memory and background overhead. Proceedings of the 2nd International Workshop on Peer-to-Peer Systems (IPTPS ’03). 2003.
D. Kempe, J. Kleinberg, A. Demers. “Spatial gossip and resource location protocols”, Proc. 33rd ACM Symp. Theory of Computing (STOC), pp. 163-172, 2001.
R. van Renesse, Y. Minsky, M. Hayden. “A gossip-style failure detection service”, Proc. IFIP Middleware, 1998.
K.P. Birman, M. Hayden, O. Ozkasap, Z. Xiao,M. Budiu, Y. Minsky. Bimodal Multicast, ACM Transactions on Computer Systems, 17:2, pp. 41-88, May 1999.
A. Demers, D.H. Greene, J. Hauser, W. Irish, J. Larson. “Epidemic algorithms for replicated database maintenance”, Proc. 6th ACM Symposium Principles of Distributed Computing (PODC), pp. 1-12, 1987.
A. Gupta, B. Liskov, R. Rodrigues. “Efficient routing for peer-to-peer overlays. Proceedings of the 1st Symposium on Networked Systems Design and Implementation” (NSDI 2004), 2004, pp. 113-116.
L. R. Monnerat, C. L. Amorim. “D1HT: A Distributed One Hop Hash Table. Proc. of the 20th IEEE Intl Parallel & Distributed Processing Symp.” (IPDPS), April 2006.
J. Buford, A. Brown, M. Kolberg. “Analysis of an Active Maintenance Algorithm for an O(1)-Hop Overlay”, IEEE Globecom 2007.
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2010 Springer Science+Business Media, LLC
About this chapter
Cite this chapter
Dhara, K., Guo, Y., Kolberg, M., Wu, X. (2010). Overview of Structured Peer-to-Peer Overlay Algorithms. In: Shen, X., Yu, H., Buford, J., Akon, M. (eds) Handbook of Peer-to-Peer Networking. Springer, Boston, MA. https://doi.org/10.1007/978-0-387-09751-0_9
Download citation
DOI: https://doi.org/10.1007/978-0-387-09751-0_9
Published:
Publisher Name: Springer, Boston, MA
Print ISBN: 978-0-387-09750-3
Online ISBN: 978-0-387-09751-0
eBook Packages: Computer ScienceComputer Science (R0)