Article

A self-repairing peer-to-peer system resilient to dynamic adversarial churn

Authors:

Roger WattenhoferAuthors Info & Claims

IPTPS'05: Proceedings of the 4th international conference on Peer-to-Peer Systems

Pages 13 - 23

https://doi.org/10.1007/11558989_2

Published: 24 February 2005 Publication History

Abstract

We present a dynamic distributed hash table where peers may join and leave at any time. Our system tolerates a powerful adversary which has complete visibility of the entire state of the system and can continuously add and remove peers. Our system provides worst-case fault-tolerance, maintaining desirable properties such as a low peer degree and a low network diameter.

References

[1]

Peleg, D., Upfal, E.: The Token Distribution Problem. SIAM J. on Computing 287(2) (1989) 229-243

Digital Library

[2]

Aberer, K.: P-Grid: A Self-Organizing Access Structure for P2P Information Systems. In Proc. 9th Int. Conference on Cooperative Information Systems (CoopIS) (2001) 179-194

Digital Library

[3]

Abraham, I., Dobzinski, O., Malkhi, D.: LAND: Stretch (1 + ε) Locality-Aware Networks for DHTs. Proc. 15th Ann. ACM-SIAM Symp. on Discrete Algorithms (SODA) (2004) 550-559

Digital Library

[4]

Aspnes, J., Shah, G.: Skip Graphs. In Proc. 14th Ann. ACM-SIAM Symp. on Discrete Algorithms (SODA) (2003) 384-393

Digital Library

[5]

Awerbuch, B., Scheideler, Ch.: The Hyperring: A Low-Congestion Deterministic Data Structure for Distributed Environments. In Proc. 15th Ann. ACM-SIAM Symp. on Discrete Algorithms (SODA) (2004)

Digital Library

[6]

Harvey, N., Jones, M., Saroiu, S., Theimer, M., Wolman, A.: SkipNet: A Scalable Overlay Network with Practical Locality Properties. In Proc. 4th USENIX Symp. on Internet Technologies and Systems (USITS) (2003)

Digital Library

[7]

Bindel, D., Chen, Y., Eaton, P., Geels, D., Gummadi, Kubiatowicz, J., R., Rhea, S., Weatherspoon, H., Weimer, W., Wells, Ch., Zhao, B.: OceanStore: An Architecture for Global-scale Persistent Storage. In Proc. of ACM ASPLOS (2000)

Digital Library

[8]

Malkhi, D., Naor, M., Ratajczak, D.: Viceroy: A Scalable and Dynamic Emulation of the Butterfly. In Proc. 21st Ann. Symp. on Principles of Distributed Computing (PODC) (2002) 183-192

Digital Library

[9]

Plaxton, G., Rajaraman, R., Richa, A.: Accessing Nearby Copies of Replicated Objects in a Distributed Environment. In Proc. 9th Ann. ACM Symp. on Parallel Algorithms and Architectures (SPAA) (1997) 311-320

Digital Library

[10]

Francis, P., Handley, Karp, R., M., Ratnasamy, S., Shenker, S.: A Scalable Content Addressable Network. In Proc. of ACM SIGCOMM 2001

Digital Library

[11]

Balakrishnan, H., Kaashoek, F., Karger, D., Morris, R., Stoica, I.: Chord: A Scalable Peer-to-peer Lookup Service for Internet Applications. In Proc. ACM SIGCOMM Conference (2001)

Digital Library

[12]

Joseph, A., Huang, L., Kubiatowicz, J., Stribling, J., Zhao, B.: Tapestry: A Resilient Global-scale Overlay for Service Deployment. IEEE Journal on Selected Areas in Communications 22 (2004)

Digital Library

[13]

Geels, D., Kubiatovicz, J., Rhea, S., Roscoe, T.: Handling Churn in a DHT. In Proc. USENIX Ann. Technical Conference (2004)

Digital Library

[14]

Fiat, A., Saia, J.: Censorship Resistant Peer-to-Peer Content Addressable Networks. In Proc. 13th Symp. on Discrete Algorithms (SODA) (2002)

Digital Library

[15]

Gribble, S., Fiat, A., Karlin, A., Saia, J., Saroiu, S.: Dynamically Fault-Tolerant Content Addressable Networks. In Proc. 1st Int. Workshop on Peer-to-Peer Systems (IPTPS) (2002)

Digital Library

[16]

Abraham, I., Awerbuch, B., Azar, Y., Bartal, Y., Malkhi, D., Pavlov, E.: A Generic Scheme for Building Overlay Networks in Adversarial Scenarios. In Proc. 17th Int. Symp. on Parallel and Distributed Processing (IPDPS) (2003)

Digital Library

[17]

Li, X., Misra, J., Plaxton, G.: Active and Concurrent Topology Maintenance. In Proc. 18th Ann. Conference on Distributed Computing (DISC) (2004)

[18]

Hurson, Kavi, K., A., Shirazi, B.: Scheduling and Load Balancing in Parallel and Distributed Systems. IEEE Computer Science Press (1995)

Digital Library

[19]

Cybenko, G: Dynamic Load Balancing for Distributed Memory Multiprocessors. Journal on Parallel Distributed Computing 7 (1989) 279-301

Digital Library

[20]

Plaxton, G.: Load Balancing, Selection and Sorting on the Hypercube. In Proc. 1st Ann. ACM Symp. on Parallel Algorithms and Architectures (SPAA) (1989) 64-73

Digital Library

[21]

Albrecht, K., Arnold, R., Gähwiler, M., Wattenhofer, R.: Aggregating Information in Peer-to-Peer Systems for Improved Join and Leave. 4th IEEE Int. Conference on Peer-to-Peer Computing (P2P) (2004)

Digital Library

[22]

Birman, P., van Renesse, R., Vogels, W.: Astrolabe: A Robust and Scalable Technology for Distributed System Monitoring, Management, and Data Mining. ACM Transactions on Computing Systems 21(2) (2003) 164-206

Digital Library

[23]

Bozdog, A., van Renesse, R.: Willow: DHT, Aggregation, and Publish/Subscribe in One Protocol. In Proc. 3rd Int. Workshop on Peer-To-Peer Systems (IPTPS) (2004)

Digital Library

[24]

Kuhn, F., Schmid, S., Smit, J., Wattenhofer, R.: Constructing Robust Dynamic Peer-to-Peer Systems. TIK Report 216, ETH Zurich, http://www.tik.ee.ethz.ch (2005)

Cited By

Feldmann MScheideler CSchmid S(2020)Survey on Algorithms for Self-stabilizing Overlay NetworksACM Computing Surveys10.1145/339719053:4(1-24)Online publication date: 11-Jul-2020
https://dl.acm.org/doi/10.1145/3397190
Castañeda ALefévre JTrehan A(2020)Fully Compact Routing in Low Memory Self-Healing TreesProceedings of the 21st International Conference on Distributed Computing and Networking10.1145/3369740.3369786(1-10)Online publication date: 4-Jan-2020
https://dl.acm.org/doi/10.1145/3369740.3369786
Kaur RSangal AKumar K(2016)A Persistent Structured Hierarchical Overlay Network to Counter Intentional Churn AttackJournal of Computer Networks and Communications10.1155/2016/51914052016(4)Online publication date: 1-Oct-2016
https://dl.acm.org/doi/10.1155/2016/5191405
Show More Cited By

A self-repairing peer-to-peer system resilient to dynamic adversarial churn

Recommendations

Understanding churn in peer-to-peer networks
IMC '06: Proceedings of the 6th ACM SIGCOMM conference on Internet measurement

The dynamics of peer participation, or churn, are an inherent property of Peer-to-Peer (P2P) systems and critical for design and evaluation. Accurately characterizing churn requires precise and unbiased information about the arrival and departure of ...
Dependable peer-to-peer systems withstanding dynamic adversarial churn
Dependable Systems

The most essential difference between classical distributed data structures and peer-to-peer systems is the dynamic behavior of the latter. Unlike traditional systems which consist of a fixed set of machines of which a few might occasionally fail in ...
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

cover image Guide Proceedings

IPTPS'05: Proceedings of the 4th international conference on Peer-to-Peer Systems

February 2005

286 pages

ISBN:3540290680

Editors:
Miguel Castro
Grupo de Inteligencia Artificial, Departamento de Computación y T.I., Universidad Simón Bolívar
,
Robbert Renesse
Grupo de Inteligencia Artificial, Departamento de Computación y T.I., Cornell University, Ithaca

Sponsors

Microsoft Corp.

Publisher

Springer-Verlag

Berlin, Heidelberg

Publication History

Published: 24 February 2005

Qualifiers

Article

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

26
Total Citations
View Citations
0
Total Downloads

Downloads (Last 12 months)0
Downloads (Last 6 weeks)0

Reflects downloads up to 26 Jan 2025

Other Metrics

View Author Metrics

Citations

Cited By

Feldmann MScheideler CSchmid S(2020)Survey on Algorithms for Self-stabilizing Overlay NetworksACM Computing Surveys10.1145/339719053:4(1-24)Online publication date: 11-Jul-2020
https://dl.acm.org/doi/10.1145/3397190
Castañeda ALefévre JTrehan A(2020)Fully Compact Routing in Low Memory Self-Healing TreesProceedings of the 21st International Conference on Distributed Computing and Networking10.1145/3369740.3369786(1-10)Online publication date: 4-Jan-2020
https://dl.acm.org/doi/10.1145/3369740.3369786
Kaur RSangal AKumar K(2016)A Persistent Structured Hierarchical Overlay Network to Counter Intentional Churn AttackJournal of Computer Networks and Communications10.1155/2016/51914052016(4)Online publication date: 1-Oct-2016
https://dl.acm.org/doi/10.1155/2016/5191405
Drees MGmyr RScheideler CScheideler CGilbert S(2016)Churn- and DoS-resistant Overlay Networks Based on Network ReconfigurationProceedings of the 28th ACM Symposium on Parallelism in Algorithms and Architectures10.1145/2935764.2935783(417-427)Online publication date: 11-Jul-2016
https://dl.acm.org/doi/10.1145/2935764.2935783
Castañeda ADolev DTrehan A(2016)Compact routing messages in self-healing treesProceedings of the 17th International Conference on Distributed Computing and Networking10.1145/2833312.2833328(1-10)Online publication date: 4-Jan-2016
https://dl.acm.org/doi/10.1145/2833312.2833328
Baldoni RBonomi SRaynal M(2016)Implementing set objects in dynamic distributed systemsJournal of Computer and System Sciences10.1016/j.jcss.2015.11.00282:5(654-689)Online publication date: 1-Aug-2016
https://dl.acm.org/doi/10.1016/j.jcss.2015.11.002
Pandurangan GRobinson PTrehan A(2016)DEXDistributed Computing10.1007/s00446-015-0258-329:3(163-185)Online publication date: 1-Jun-2016
https://dl.acm.org/doi/10.1007/s00446-015-0258-3
Jacob RRicha AScheideler CSchmid STäubig H(2014)SKIP+Journal of the ACM10.1145/262969561:6(1-26)Online publication date: 17-Dec-2014
https://dl.acm.org/doi/10.1145/2629695
Nor RNesterenko MScheideler C(2013)CoronaTheoretical Computer Science10.1016/j.tcs.2012.08.029512(119-129)Online publication date: 1-Nov-2013
https://dl.acm.org/doi/10.1016/j.tcs.2012.08.029
Kniesburges SKoutsopoulos AScheideler C(2013)CONE-DHTProceedings of the 27th International Symposium on Distributed Computing - Volume 820510.1007/978-3-642-41527-2_37(537-549)Online publication date: 14-Oct-2013
https://dl.acm.org/doi/10.1007/978-3-642-41527-2_37
Show More Cited By

View Options

View options

Figures

Tables

Media

View Table of Conten