A Self-repairing Peer-to-Peer System Resilient to Dynamic Adversarial Churn

  • Fabian Kuhn
  • Stefan Schmid
  • Roger Wattenhofer
Part of the Lecture Notes in Computer Science book series (LNCS, volume 3640)


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.


Data Item Overlay Network Distribute Hash Table Token Distribution Content Addressable Network 
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.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    Peleg, D., Upfal, E.: The Token Distribution Problem. SIAM J. on Computing 287(2), 229–243 (1989)CrossRefMathSciNetGoogle Scholar
  2. 2.
    Aberer, K.: P-Grid: A Self-Organizing Access Structure for P2P Information Systems. In: Batini, C., Giunchiglia, F., Giorgini, P., Mecella, M. (eds.) CoopIS 2001. LNCS, vol. 2172, pp. 179–194. Springer, Heidelberg (2001)CrossRefGoogle Scholar
  3. 3.
    Abraham, I., Dobzinski, O., Malkhi, D.: LAND: Stretch (1 + ε) Locality-Aware Networks for DHTs. In: Proc. 15th Ann. ACM-SIAM Symp. on Discrete Algorithms (SODA), pp. 550–559 (2004)Google Scholar
  4. 4.
    Aspnes, J., Shah, G.: Skip Graphs. In: Proc. 14th Ann. ACM-SIAM Symp. on Discrete Algorithms (SODA), pp. 384–393 (2003)Google Scholar
  5. 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)Google Scholar
  6. 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)Google Scholar
  7. 7.
    Bindel, D., Chen, Y., Eaton, P., Geels, D., Gummadi, R., Kubiatowicz, J., Rhea, S., Weatherspoon, H., Weimer, W., Wells, C., Zhao, B.: OceanStore: An Architecture for Global-scale Persistent Storage. In: Proc. of ACM ASPLOS (2000)Google Scholar
  8. 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), pp. 183–192 (2002)Google Scholar
  9. 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), pp. 311–320 (1997)Google Scholar
  10. 10.
    Francis, P., Handley, M., Karp, R., Ratnasamy, S., Shenker, S.: A Scalable Content Addressable Network. In: Proc. of ACM SIGCOMM 2001 (2001)Google Scholar
  11. 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)Google Scholar
  12. 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)Google Scholar
  13. 13.
    Geels, D., Kubiatovicz, J., Rhea, S., Roscoe, T.: Handling Churn in a DHT. In: Proc. USENIX Ann. Technical Conference (2004)Google Scholar
  14. 14.
    Fiat, A., Saia, J.: Censorship Resistant Peer-to-Peer Content Addressable Networks. In: Proc. 13th Symp. on Discrete Algorithms (SODA) (2002)Google Scholar
  15. 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)Google Scholar
  16. 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)Google Scholar
  17. 17.
    Li, X., Misra, J., Plaxton, G.: Active and Concurrent Topology Maintenance. In: Proc. 18th Ann. Conference on Distributed Computing (DISC) (2004)Google Scholar
  18. 18.
    Hurson, A.R., Kavi, K., Shirazi, B.: Scheduling and Load Balancing in Parallel and Distributed Systems. IEEE Computer Science Press, Los Alamitos (1995)Google Scholar
  19. 19.
    Cybenko, G.: Dynamic Load Balancing for Distributed Memory Multiprocessors. Journal on Parallel Distributed Computing 7, 279–301 (1989)CrossRefGoogle Scholar
  20. 20.
    Plaxton, G.: Load Balancing, Selection and Sorting on the Hypercube. In: Proc. 1st Ann. ACM Symp. on Parallel Algorithms and Architectures (SPAA), pp. 64–73 (1989)Google Scholar
  21. 21.
    Albrecht, K., Arnold, R., Gähwiler, M., Wattenhofer, R.: Aggregating Information in Peer-to-Peer Systems for Improved Join and Leave. In: 4th IEEE Int. Conference on Peer-to-Peer Computing (P2P) (2004)Google Scholar
  22. 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), 164–206 (2003)CrossRefGoogle Scholar
  23. 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)Google Scholar
  24. 24.
    Kuhn, F., Schmid, S., Smit, J., Wattenhofer, R.: Constructing Robust Dynamic Peer-to-Peer Systems. TIK Report 216, ETH Zurich (2005),

Copyright information

© Springer-Verlag Berlin Heidelberg 2005

Authors and Affiliations

  • Fabian Kuhn
    • 1
  • Stefan Schmid
    • 1
  • Roger Wattenhofer
    • 1
  1. 1.Computer Engineering and Networks LaboratoryETH ZurichZurichSwitzerland

Personalised recommendations