Skip to main content
SpringerLink
Log in

Towards worst-case churn resistant peer-to-peer systems

  • Published:
Distributed Computing Aims and scope Submit manuscript

Abstract

Until now, the analysis of fault tolerance of peer-to-peer systems usually only covers random faults of some kind. Contrary to traditional algorithmic research, faults as well as joins and leaves occurring in a worst-case manner are hardly considered. In this article, we devise techniques to build dynamic peer-to-peer systems which remain fully functional in spite of an adversary who continuously adds and removes peers. We exemplify our algorithms on hypercube and pancake topologies and present a system which maintains small peer degree and network diameter.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Similar content being viewed by others

References

  1. Abraham, I., Awerbuch, B., Azar, Y., Bartal, Y., Malkhi, D., Pavlov, E.: A generic scheme for building overlay networks in adversarial scenarios. In: Proceedings 17th International Symposium on Parallel and Distributed Processing (IPDPS) (2003)

  2. Akers S.B., Krishnamurthy B.: A group-theoretic model for symmetric interconnection networks. IEEE Trans. Comput. 38(4), 555–566 (1989)

    Article  MATH  MathSciNet  Google Scholar 

  3. Albrecht, K., Arnold, R., Gähwiler, M., Wattenhofer, R.: Aggregating information in peer-to-peer systems for improved join and leave. In: Proceedings 4th IEEE International Conference on Peer-to-Peer Computing (P2P) (2004)

  4. Annexstein F., Baumslag M., Rosenberg A.L.: Group action graphs and parallel architectures. SIAM J. Comput. 19(3), 544–569 (1990)

    Article  MATH  MathSciNet  Google Scholar 

  5. Awerbuch, B., Scheideler, C.: The hyperring: a low-congestion deterministic data structure for distributed environments. In: Proceedings of 15th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), pp. 318–327 (2004)

  6. Awerbuch, B., Scheideler, C.: Robust random number generation for peer-to-peer systems. In: Proceedings of 10th International Conference on Principles of Distributed Systems (OPODIS) (2006)

  7. Awerbuch, B., Scheideler, C.: Towards a scalable and robust DHT. In: Proceedings of 18th ACM Symposium on Parallel Algorithms and Architectures (SPAA) (2006)

  8. Bhagwan, R., Savage, S., Voelker, G.: Understanding availability. In: Proceedings of 2nd International Workshop on Peer-to-Peer Systems (IPTPS) (2003)

  9. Bhargava, A., Kothapalli, K., Riley, C., Scheideler, C., Thober, M.: Pagoda: a dynamic overlay network for routing, data management, and multicasting. In: Proceedings of 16th Annual ACM Symposium on Parallel Algorithms and Architectures (SPAA), pp. 170–179 (2004)

  10. Clouser, T., Nesterenko, M., Scheideler, C.: Tiara: A self-stabilizing deterministic skip list. In: Proceedings of SSS (2008)

  11. Cybenko G.: Dynamic load balancing for distributed memory multiprocessors. J. Parallel Distrib. Comput. 7, 279–301 (1989)

    Article  Google Scholar 

  12. Datta, A., Aberer, K.: Internet-scale storage systems under churn. In: Proceedings of 6th IEEE International Conference on Peer-to-Peer Computing (P2P) (2006)

  13. Dweighter, H. (a.k.a. J. E. Goodman): Problem E2569. American Mathematical Monthly, vol. 82 (1975)

  14. Fiat, A., Saia, J.: Censorship resistant peer-to-peer content addressable networks. In: Proceedings of 13th Symposium on Discrete Algorithms (SODA) (2002)

  15. Fiat, A., Saia, J., Young, M.: Making chord Robust to byzantine attacks. In: Proceedings of European Symposium on Algorithms (ESA) (2005)

  16. Gall, D., Jacob, R., Richa, A., Scheideler, C., Schmid, S., Täubig, H.: Brief announcement: on the time complexity of distributed topological self-stabilization. In: Proceedings of International Symposium on Stabilization, Safety, and Security of Distributed Systems (SSS) (2009)

  17. Garey, M.R., Johnson, D.S.: Computers and Intractability: A Guide to the Theory of NP-Completeness (Series of books in the mathematical sciences). W.H. Freeman, San Francisco (1979)

  18. Godfrey, P.B., Shenker, S., Stoica, I.: Minimizing churn in distributed systems. In: Proceedings of ACM SIGCOMM Conference on Applications, Technologies, Architectures, and Protocols for Computer Communications (2006)

  19. Guha, S., Daswani, N., Jain, R.: An experimental study of the skype peer-to-peer VoIP system. In: Proceedings of 5th International Workshop on Peer-to-Peer Systems (IPTPS) (2006)

  20. Haeberlen, A., Mislove, A., Post, A., Druschel, P.: Fallacies in evaluating decentralized systems. In: Proceedings 5th International Workshop on Peer-to-Peer Systems (IPTPS) (2006)

  21. Harvey N., Munro J.: Deterministic skipnet. Inf. Process. Lett. 90(4), 205–208 (2004)

    Article  MATH  MathSciNet  Google Scholar 

  22. Jacob, R., Richa, A., Scheideler, C., Schmid, S., Täubig, H.: A distributed polylogarithmic time algorithm for self-stabilizing skip graphs. In: Proceedings of Annual ACM Symposium on Principles of Distributed Computing (PODC) (2009)

  23. Jacob, R., Ritscher, S., Scheideler, C., Schmid, S.: A self-stabilizing and local delaunay graph construction. In: Proceedings of 20th International Symposium on Algorithms and Computation (ISAAC) (2009)

  24. Kempe, D., Dobra, A., Gehrke, J.: Gossip-based computation of aggregate information. In: Proceedings of 44th Annual IEEE Symposium on Foundations of Computer Science (FOCS) (2003)

  25. Kothapalli, K., Scheideler, C.: Supervised peer-to-peer systems. In: Proceedings of International Symposium on Parallel Architectures, Algorithms, and Networks (I-SPAN), pp. 188–193 (2005)

  26. Kuhn, F., Locher, T., Wattenhofer, R.: Tight bounds for distributed selection. In: Proceedings of 19th ACM Symposium on Parallelism in Algorithms and Architectures (SPAA) (2007)

  27. Kuhn, F., Schmid, S., Smit, J., Wattenhofer, R.: A blueprint for constructing peer-to-peer systems Robust to dynamic worst-case joins and leaves. In: Proceedings of 14th IEEE International Workshop on Quality of Service (IWQoS) (2006)

  28. Kuhn, F., Schmid, S., Wattenhofer, R.: A self-repairing peer-to-peer system resilient to dynamic adversarial churn. In: Proceedings of 4th International Workshop on Peer-To-Peer Systems (IPTPS) (2005)

  29. Li, J., Stribling, J., Morris, R., Kaashoek, M.F., Gil, T.M.: A performance versus cost framework for evaluating DHT design tradeoffs under churn. In: Proceedings of 24th Annual IEEE Conference on Computer Communications (INFOCOM) (2005)

  30. Li, X., Misra, J., Plaxton, C.G.: Active and concurrent topology maintenance. In: Proceedings of 18th Annual Conference on Distributed Computing (DISC) (2004)

  31. Liben-Nowell, D., Balakrishnan, H., Karger, D.: Analysis of the evolution of peer-to-peer systems. In: Proceedings of 21st Annual Symposium on Principles of Distributed Computing (PODC), pp. 233–242 (2002)

  32. Locher, T., Schmid, S., Wattenhofer, R.: eQuus: a provably Robust and locality-aware peer-to-peer system. In: Proceedings of 6th IEEE International Conference on Peer-to-Peer Computing (P2P) (2006)

  33. Mitra, B., Ghose, S., Ganguly, N.: Effect of dynamicity on peer-to-peer networks. In: Proceedings of 14th International Conference on High Performance Computing (HiPC) (2007)

  34. Mosk-Aoyama, D., Shah, D.: Computing separable functions via gossip. In: Proceedings of 25th Annual ACM Symposium on Principles of Distributed Computing (PODC), pp. 113–122 (2006)

  35. Naor, M., Wieder, U.: Novel architectures for P2P applications: the continuous-discrete approach. In: Proceedings of 15th Annual ACM Symposium on Parallel Algorithms and Architectures (SPAA), pp. 50–59 (2003)

  36. Pandurangan, G., Raghavan, P., Upfal, E.: Building low-diameter P2P networks. In: Proceedings of 42nd Annual IEEE Symposium on Foundations of Computer Science (FOCS) (2001)

  37. Patt-Shamir B.: A note on efficient aggregate queries in sensor networks. Theor. Comput. Sci. 370(1–3), 254–264 (2007)

    Article  MATH  MathSciNet  Google Scholar 

  38. Peleg D.: Distributed Computing A Locality-sensitive Approach. Society for Industrial and Applied Mathematics, Philadelphia, PA (2000)

    MATH  Google Scholar 

  39. Peleg D., Upfal E.: The token distribution problem. SIAM J. Comput. 18(2), 229–243 (1989)

    Article  MATH  MathSciNet  Google Scholar 

  40. Plaxton, C.G.: Load Balancing, Selection and Sorting on the Hypercube. In: Proceedings of the 1st Annual ACM Symposium on Parallel Algorithms and Architectures (SPAA), pp. 64–73 (1989)

  41. Qiao, Y., Bustamante, F.E.: Structured and unstructured overlays under the microscope—a measurement-based view of two P2P systems that people use. In: Proceedings of the USENIX Annual Technical Conference (2006)

  42. Ratnasamy, S., Francis, P., Handley, M., Karp, R., Schenker, S.: A scalable content-addressable network. In: Proceedings of the ACM SIGCOMM Conference on Applications, Technologies, Architectures, and Protocols for Computer Communications, pp. 161–172 (2001)

  43. Rhea, S., Chun, B.-G., Kubiatowicz, J., Shenker, S.: Fixing the embarrassing slowness of openDHT on planetLab. In: Proceedings of the 2nd Conference on Real, Large Distributed Systems (WORLDS) (2005)

  44. Rhea, S., Geels, D., Roscoe, T., Kubiatowicz, J.: Handling churn in a DHT. In: Proceedings of the USENIX Annual Technical Conference (2004)

  45. Rowstron, A., Druschel, P.: Pastry: scalable, decentralized object location and routing for large-scale peer-to-peer systems. In: Proceedings of the IFIP/ACM International Conference on Distributed Systems Platforms (Middleware), pp. 329–350 (2001)

  46. Saia, J., Fiat, A., Gribble, S., Karlin, A., Saroiu, S.: Dynamically fault-tolerant content addressable networks. In: Proceedings of the 1st International Workshop on Peer-to-Peer Systems (IPTPS) (2002)

  47. Saroiu, S., Gummadi, P.K., Gribble, S.D.: A measurement study of peer-to-peer file sharing systems. In: Proceedings of the Multimedia Computing and Networking (MMCN) (2002)

  48. Scheideler, C.: How to spread adversarial nodes? rotate! In: Proceedings of the 37th ACM Symposium on Theory of Computing (STOC) (2005)

  49. Scheideler, C., Schmid, S.: A distributed and oblivious heap. In: Proceedings of the 36th International Colloquium on Automata, Languages and Programming (ICALP) (2009)

  50. Sen S., Wang J.: Analyzing peer-to-peer traffic across large networks. IEEE/ACM Trans. Netw. 12(2), 219–232 (2003)

    Article  Google Scholar 

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

    Google Scholar 

  52. Steiner, M., Biersack, E.W., Ennajjary, T.: Actively monitoring peers in KAD. In: Proceedings of the 6th International Workshop on Peer-to-Peer Systems (IPTPS) (2007)

  53. Stutzbach, D., Rejaie, R.: Understanding churn in peer-to-peer networks. In: Proceedings of the 6th Internet Measurement Conference (IMC) (2006)

  54. Tian, J., Dai, Y.: Understanding the dynamic of peer-to-peer systems. In: Proceedings of the 6th International Workshop on Peer-to-Peer Systems (IPTPS) (2007)

  55. Van Renesse R., Birman K.P., Vogels W.: Astrolabe: a robust and scalable technology for distributed system monitoring, management, and data mining. ACM Trans. Comput. Syst. 21(2), 164–206 (2003)

    Article  Google Scholar 

  56. Van Renesse, R., Bozdog, A.: Willow: DHT, aggregation, and publish/subscribe in one protocol. In: Proceedings of the 3rd International Workshop on Peer-To-Peer Systems (IPTPS) (2004)

  57. Yang, M., Chen, H., Zhao, B.Y., Dai, Y., Zhang, Z.: Deployment of a large scale peer-to-peer social network. In: Proceedings of the 1st Workshop on Real, Large Distributed Systems (2004)

  58. Yusuke, K., Keiichi, K., Yuji, S.: Computing the diameter of the Pancake Graph. Joho Shori Gakkai Kenkyu Hokoku, 42 (2004)

Download references

Author information

Authors and Affiliations

  1. Faculty of Informatics, University of Lugano, 6904, Lugano, Switzerland

    Fabian Kuhn

  2. Deutsche Telekom Laboratories (T-Labs), Technische Universität Berlin, 10587, Berlin, Germany

    Stefan Schmid

  3. Computer Engineering an Networks Laboratory, ETH Zurich, 8092, Zurich, Switzerland

    Roger Wattenhofer

Authors
  1. Fabian Kuhn
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Stefan Schmid
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Roger Wattenhofer
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Stefan Schmid.

Additional information

A preliminary version of this work has been presented at the 4th International Workshop on Peer-To-Peer Systems (IPTPS 2005) [28] and the 14th IEEE International Workshop on Quality of Service (IWQoS 2006) [27].

Rights and permissions

Reprints and permissions

About this article

Cite this article

Kuhn, F., Schmid, S. & Wattenhofer, R. Towards worst-case churn resistant peer-to-peer systems. Distrib. Comput. 22, 249–267 (2010). https://doi.org/10.1007/s00446-010-0099-z

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s00446-010-0099-z

Keywords

Search

Navigation