Article

Analysis of the evolution of peer-to-peer systems

Authors:

David Liben-Nowell,

Hari Balakrishnan,

David KargerAuthors Info & Claims

PODC '02: Proceedings of the twenty-first annual symposium on Principles of distributed computing

Pages 233 - 242

https://doi.org/10.1145/571825.571863

Published: 21 July 2002 Publication History

Get Access

Abstract

In this paper, we give a theoretical analysis of peer-to-peer (P2P) networks operating in the face of concurrent joins and unexpected departures. We focus on Chord, a recently developed P2P system that implements a distributed hash table abstraction, and study the process by which Chord maintains its distributed state as nodes join and leave the system. We argue that traditional performance measures based on run-time are uninformative for a continually running P2P network, and that the rate at which nodes in the network need to participate to maintain system state is a more useful metric. We give a general lower bound on this rate for a network to remain connected, and prove that an appropriately modified version of Chord's maintenance rate is within a logarithmic factor of the optimum rate.

References

[1]

Dabek, F., Brunskill, E., Kaashoek, M. F., Karger, D., Morris, R., Stoica, I., and Balakrishnan, H. Building peer-to-peer systems with Chord, a distributed location service. In Proc. IEEE Workshop on Hot Topics in Operating Systems (HotOS-VIII) (2001).

Digital Library

Google Scholar

[2]

Dabek, F., Kaashoek, M. F., Karger, D., Morris, R., and Stoica, I. Wide-area cooperative storage with CFS. In Proc. SOSP (2001).

Digital Library

Google Scholar

[3]

Druschel, P.,and Rowstron, A. Past: Persistent and anonymous storage in a peer-to-peer networking environment. In Proceedings of the 8th IEEE Workshop on Hot Topics in Operating Systems (HotOS-VIII) (2001), pp. 65-70.

Crossref

Google Scholar

[4]

Fiat, A., and Saia, J. Censorship resistant peer-to-peer content addressable networks. In Proc. SODA (2002).

Digital Library

Google Scholar

[5]

Karger, D., Lehman, E., Leighton, F., Levine, M., Lewin, D., and Panigrahy R. Consistent hashing and random trees: Distributed caching protocols for relieving hot spots on the World Wide Web. In Proc. STOC (1997).

Digital Library

Google Scholar

[6]

Kubiatowicz, J., Bindel, D., Chen, Y., Czerwinski, S., Eaton, P., Geels, D., Gummadi, R., Rhea, S., Weatherspoon, H., Weimer, W., Wells, C., and Zhao, B. OceanStore: An architecture for global-scale persistent storage. In Proc. ASPLOS (2000).

Digital Library

Google Scholar

[7]

Lewin, D. Consistent hashing and random trees: Algorithms for caching in distributed networks. Master's thesis, Department of EECS, MIT, 1998. Available at the MIT Library, http://thesis.mit.edu/.

Google Scholar

[8]

Pandurangan, G., Raghavan, P., and Upfal, E. Building low-diameter P2P networks. In Proc. FOCS (2001).

Digital Library

Google Scholar

[9]

Plaxton, C., Rajaraman, R., and Richa, A. Accessing nearby copies of replicated objects in a distributed environment. In Proc. SPAA (1997).

Digital Library

Google Scholar

[10]

Ratnasamy, S., Francis, P., Handley, M., Karp, R., and Shenker, S. A scalable content-addressable network. In Proc. SIGCOMM (2001).

Digital Library

Google Scholar

[11]

Saia, J., Fiat, A., Gribble, S., Karlin, A. R., and Saroiu, S. Dynamically fault-tolerant content addressable networks. In Proc. IPTPS (2002).

Digital Library

Google Scholar

[12]

Stpoca, I., Morris, R., Karger, D., Kaashoek, M. F., and Balakrishnan, H. Chord: A scalable peer-to-peer lookup service for internet applications. In Proc. SIGCOMM (2001).

Digital Library

Google Scholar

[13]

Stoica, I., Morris, R., Loben-Nowell, D., Karger, D., Kaashoek, M. F., Dabek, F., and Balakrishnan, H. Chord: A scalable peer-to-peer lookup service for internet applications. Tech. Rep. TR-819, MIT LCS, 2001. http://www.pdos.lcs.mit.edu/chord/papers/.

Digital Library

Google Scholar

[14]

Zhao, B., Kubiatowicz, J., and Joseph, A. Tapestry: An infrastructure for fault-tolerant wide-area location and routing. Tech. Rep. UCB/CSD-01-1141, Computer Science Division, U. C. Berkeley, Apr. 2001.

Digital Library

Google Scholar

Cited By

View all

Doan Van DAi Q(2023)In-network caching in information-centric networks for different applications: A surveyCogent Engineering10.1080/23311916.2023.221000010:1Online publication date: 14-May-2023
https://doi.org/10.1080/23311916.2023.2210000
Gupta DSaia JYoung M(2023)Bankrupting Sybil despite churnJournal of Computer and System Sciences10.1016/j.jcss.2023.02.004135(89-124)Online publication date: Aug-2023
https://doi.org/10.1016/j.jcss.2023.02.004
Aradhya VGilbert SHobor A(2023)Robust Overlays Meet BlockchainsStabilization, Safety, and Security of Distributed Systems10.1007/978-3-031-44274-2_15(191-206)Online publication date: 30-Sep-2023
https://doi.org/10.1007/978-3-031-44274-2_15
Show More Cited By

Analysis of the evolution of peer-to-peer systems
1. Computer systems organization
  1. Architectures
2. Software and its engineering
  1. Software organization and properties
    1. Software system structures

Recommendations

An efficient and secure overlay network for general peer-to-peer systems
Performance analysis of structured peer-to-peer overlays for mobile networks

Distributed Hash Table DHT based Peer-to-Peer P2P overlays have been widely researched and deployed in many applications such as file sharing, IP telephony, content distribution and media streaming applications. However, their deployment has largely ...
An Efficient Hybrid Peer-to-Peer System for Distributed Data Sharing

Peer-to-peer overlay networks are widely used in distributed systems. Based on whether a regular topology is maintained among peers, peer-to-peer networks can be divided into two categories: structured peer-to-peer networks in which peers are connected ...

Comments

Information & Contributors

Information

Published In

PODC '02: Proceedings of the twenty-first annual symposium on Principles of distributed computing

July 2002

307 pages

ISBN:1581134851

DOI:10.1145/571825

Conference Chair:
Aleta Ricciardi
Valaran Corp.

Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 21 July 2002

Permissions

Request permissions for this article.

Request Permissions

Check for updates

Qualifiers

Article

Conference

PODC02

Sponsor:

PODC02: Principles of Distributed Computing

July 21 - 24, 2002

California, Monterey

Acceptance Rates

PODC '02 Paper Acceptance Rate 43 of 149 submissions, 29%;

Overall Acceptance Rate 740 of 2,477 submissions, 30%

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

245
Total Citations
View Citations
1,963
Total Downloads

Downloads (Last 12 months)32
Downloads (Last 6 weeks)3

Reflects downloads up to 15 Oct 2024

Other Metrics

View Author Metrics

Citations

Cited By

View all

Doan Van DAi Q(2023)In-network caching in information-centric networks for different applications: A surveyCogent Engineering10.1080/23311916.2023.221000010:1Online publication date: 14-May-2023
https://doi.org/10.1080/23311916.2023.2210000
Gupta DSaia JYoung M(2023)Bankrupting Sybil despite churnJournal of Computer and System Sciences10.1016/j.jcss.2023.02.004135(89-124)Online publication date: Aug-2023
https://doi.org/10.1016/j.jcss.2023.02.004
Aradhya VGilbert SHobor A(2023)Robust Overlays Meet BlockchainsStabilization, Safety, and Security of Distributed Systems10.1007/978-3-031-44274-2_15(191-206)Online publication date: 30-Sep-2023
https://doi.org/10.1007/978-3-031-44274-2_15
Behera RNaik DRamesh DRath S(2020)MR-IBC: MapReduce-based incremental betweenness centrality in large-scale complex networksSocial Network Analysis and Mining10.1007/s13278-020-00636-910:1Online publication date: 12-Apr-2020
https://doi.org/10.1007/s13278-020-00636-9
Wang XXiao DLi XCline DLoguinov D(2019)Consistent Sampling of Churn Under Periodic Non-Stationary Arrivals in Distributed SystemsACM Transactions on Modeling and Performance Evaluation of Computing Systems10.1145/33685104:4(1-33)Online publication date: 10-Dec-2019
https://dl.acm.org/doi/10.1145/3368510
Brunel JChemouil DTawa J(2018)Analyzing the Fundamental Liveness Property of the Chord Protocol2018 Formal Methods in Computer Aided Design (FMCAD)10.23919/FMCAD.2018.8603001(1-9)Online publication date: Oct-2018
https://doi.org/10.23919/FMCAD.2018.8603001
Augustine JSivasubramaniam S(2018)Spartan: A Framework For Sparse Robust Addressable Networks2018 IEEE International Parallel and Distributed Processing Symposium (IPDPS)10.1109/IPDPS.2018.00115(1060-1069)Online publication date: May-2018
https://doi.org/10.1109/IPDPS.2018.00115
Kaur RSangal AKumar K(2017)Churn handling strategies for structured overlay networks: A surveyMultiagent and Grid Systems10.3233/MGS-17027413:4(331-351)Online publication date: 11-Dec-2017
https://doi.org/10.3233/MGS-170274
Zave P(2017)Reasoning About Identifier SpacesIEEE Transactions on Software Engineering10.1109/TSE.2017.265505643:12(1144-1156)Online publication date: 1-Dec-2017
https://dl.acm.org/doi/10.1109/TSE.2017.2655056
Pass RSeeman LShelat A(2017)Analysis of the Blockchain Protocol in Asynchronous NetworksAdvances in Cryptology – EUROCRYPT 201710.1007/978-3-319-56614-6_22(643-673)Online publication date: 1-Apr-2017
https://doi.org/10.1007/978-3-319-56614-6_22
Show More Cited By

View Options

Get Access

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

Cited By

Recommendations

An efficient and secure overlay network for general peer-to-peer systems

Performance analysis of structured peer-to-peer overlays for mobile networks

An Efficient Hybrid Peer-to-Peer System for Distributed Data Sharing

Comments

Published In

Sponsors

Publisher

Publication History

Permissions

Check for updates

Qualifiers

Conference

Acceptance Rates

Other Metrics

Article Metrics

Other Metrics

Cited By

Login options

Full Access

PDF

eReader

Abstract

References

Cited By

Recommendations

An efficient and secure overlay network for general peer-to-peer systems

Performance analysis of structured peer-to-peer overlays for mobile networks

An Efficient Hybrid Peer-to-Peer System for Distributed Data Sharing

Comments

Information

Published In

Sponsors

Publisher

Publication History

Permissions

Check for updates

Qualifiers

Conference

Acceptance Rates

Contributors

Other Metrics

Bibliometrics

Article Metrics

Other Metrics

Citations

Cited By

Get Access

Login options

Full Access

View options

PDF

eReader

Figures

Other

Share

Share this Publication link

Share on social media

Affiliations