Advertisement

A Statistical Theory of Chord Under Churn

  • Supriya Krishnamurthy
  • Sameh El-Ansary
  • Erik Aurell
  • Seif Haridi
Part of the Lecture Notes in Computer Science book series (LNCS, volume 3640)

Abstract

Most earlier studies of DHTs under churn have either depended on simulations as the primary investigation tool, or on establishing bounds for DHTs to function. In this paper, we present a complete analytical study of churn using a master-equation-based approach, used traditionally in non-equilibrium statistical mechanics to describe steady-state or transient phenomena. Simulations are used to verify all theoretical predictions. We demonstrate the application of our methodology to the Chord system. For any rate of churn and stabilization rates, and any system size, we accurately predict the fraction of failed or incorrect successor and finger pointers and show how we can use these quantities to predict the performance and consistency of lookups under churn. We also discuss briefly how churn may actually be of different ’types’ and the implications this will have for the functioning of DHTs in general.

Keywords

Distribute Hash Table Successor Pointer Consecutive Node Alive Node Wrong Pointer 
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.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Liben-Nowell, D., Balakrishnan, H., Karger, D.: Analysis of the evolution of peer-to-peer systems. In: ACM Conf. on Principles of Distributed Computing (PODC), Monterey, CA (2002)Google Scholar
  2. 2.
    Aspnes, J., Diamadi, Z., Shah, G.: Fault-tolerant routing in peer-to-peer systems. In: Proceedings of the twenty-first annual symposium on Principles of distributed computing, pp. 223–232. ACM Press, New York (2002)CrossRefGoogle Scholar
  3. 3.
    Li, J., Stribling, J., Gil, T.M., Morris, R., Kaashoek, F.: Comparing the performance of distributed hash tables under churn. In: Voelker, G.M., Shenker, S. (eds.) IPTPS 2004. LNCS, vol. 3279, pp. 87–99. Springer, Heidelberg (2005)CrossRefGoogle Scholar
  4. 4.
    Rhea, S., Geels, D., Roscoe, T., Kubiatowicz, J.: Handling churn in a DHT. In: Proceedings of the 2004 USENIX Annual Technical Conference(USENIX 2004), Boston, Massachusetts, USA (2004)Google Scholar
  5. 5.
    Castro, M., Costa, M., Rowstron, A.: Performance and dependability of structured peer-to-peer overlays. In: Proceedings of the 2004 International Conference on Dependable Systems and Networks (DSN 2004). IEEE Computer Society, Los Alamitos (2004)Google Scholar
  6. 6.
    van Kampen, N.G.: Stochastic Processes in Physics and Chemistry. North-Holland Publishing Company, Amsterdam (1981) ISBN-0-444-86200-5zbMATHGoogle Scholar
  7. 7.
    Stoica, I., Morris, R., Liben-Nowell, D., Karger, D., Kaashoek, M.F., Dabek, F., Balakrishnan, H.: Chord: A scalable peer-to-peer lookup service for internet applications. IEEE Transactions on Networking 11 (2003)Google Scholar
  8. 8.
    Wang, S., Xuan, D., Zhao, W.: On resilience of structured peer-to-peer systems. In: GLOBECOM 2003 - IEEE Global Telecommunications Conference, pp. 3851–3856 (2003)Google Scholar
  9. 9.
    Aberer, K., Datta, A., Hauswirth, M.: Efficient, self-contained handling of identity in peer-to-peer systems. IEEE Transactions on Knowledge and Data Engineering 16, 858–869 (2004)CrossRefGoogle Scholar
  10. 10.
    El-Ansary, S., Krishnamurthy, S., Aurell, E., Haridi, S.: An analytical study of consistency and performance of DHTs under churn (draft). Technical Report TR-2004-12, Swedish Institute of Computer Science (2004), http://www.sics.se/~sameh/pubs/TR2004_12

Copyright information

© Springer-Verlag Berlin Heidelberg 2005

Authors and Affiliations

  • Supriya Krishnamurthy
    • 1
  • Sameh El-Ansary
    • 1
  • Erik Aurell
    • 2
  • Seif Haridi
    • 3
  1. 1.Swedish Institute of Computer ScienceKistaSweden
  2. 2.Department of PhysicsKTH-Royal Institute of TechnologySweden
  3. 3.IMIT-Royal Institute of TechnologyKistaSweden

Personalised recommendations