Location via proxy:   [ UP ]  
[Report a bug]   [Manage cookies]                
Skip to main content
Springer Nature Link
Log in

Estimating Churn in Structured P2P Networks

  • Conference paper
Managing Traffic Performance in Converged Networks (ITC 2007)

Part of the book series: Lecture Notes in Computer Science ((LNCCN,volume 4516))

Included in the following conference series:

  • 1459 Accesses

Abstract

In structured peer-to-peer (P2P) networks participating peers can join or leave the system at arbitrary times, a process which is known as churn. Many recent studies revealed that churn is one of the main problems faced by any Distributed Hash Table (DHT). In this paper we discuss different possibilities of how to estimate the current churn rate in the system. In particular, we show how to obtain a robust estimate which is independent of the implementation details of the DHT. We also investigate the trade-offs between accuracy, overhead, and responsiveness to changes.

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

Access this chapter

Log in via an institution

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Similar content being viewed by others

References

  1. Rhea, S., Geels, D., Roscoe, T., Kubiatowicz, J.: Handling Churn in a DHT. In: USENIX Annual Technical Conference, Boston, MA (2004)

    Google Scholar 

  2. Binzenhöfer, A., Staehle, D., Henjes, R.: On the Stability of Chord-based P2P Systems. In: GLOBECOM 2005, St. Louis, MO, USA, p. 5 (2005)

    Google Scholar 

  3. Stoica, I., Morris, R., Karger, D., Kaashoek, M.F., Balakrishnan, H.: Chord: A Scalable Peer-to-peer Lookup Service for Internet Applications. In: Proc. of ACM SIGCOMM’01, San Diego, CA, ACM Press, New York (2001)

    Google Scholar 

  4. Maymounkov, P., Mazieres, D.: Kademlia: A peer-to-peer information system based on the xor metric. In: Druschel, P., Kaashoek, M.F., Rowstron, A. (eds.) IPTPS 2002. LNCS, vol. 2429, Springer, Heidelberg (2002)

    Google Scholar 

  5. Rowstron, A., Druschel, P.: Pastry: Scalable, distributed object location and routing for large-scale peer-to-peer systems. In: Guerraoui, R. (ed.) Middleware 2001. LNCS, vol. 2218, Springer, Heidelberg (2001)

    Google Scholar 

  6. Liben-Nowell, D., Balakrishnan, H., Karger, D.: Analysis of the Evolution of Peer-to-Peer Systems. In: Proc. of ACM PODC, Monterey, CA, ACM Press, New York (2002)

    Google Scholar 

  7. Krishnamurthy, S., El-Ansary, S., Aurell, E., Haridi, S.: A statistical theory of chord under churn. In: Castro, M., van Renesse, R. (eds.) IPTPS 2005. LNCS, vol. 3640, Springer, Heidelberg (2005)

    Chapter  Google Scholar 

  8. Godfrey, P.B., Shenker, S., Stoica, I.: Minimizing churn in distributed systems. In: Proc. of ACM SIGCOMM, Pisa, Italy, ACM Press, New York (2006)

    Google Scholar 

  9. Gummadi, K.P., Dunn, R.J., Saroiu, S., Gribble, S.D., Levy, H.M., Zahorjan, J.: Measurement, modeling, and analysis of a peer-to-peer file-sharing workload. In: Proc. of ACM SOSP’03, Bolton Landing, NY, ACM Press, New York (2003)

    Google Scholar 

  10. Bhagwan, R., Savage, S., Voelker, G.: Understanding availability. In: Kaashoek, M.F., Stoica, I. (eds.) IPTPS 2003. LNCS, vol. 2735, Springer, Heidelberg (2003)

    Google Scholar 

  11. Castro, M., Costa, M., Rowstron, A.: Performance and dependability of structured peer-to-peer overlays. In: Proc. of DSN’04, Washington, DC (2004)

    Google Scholar 

  12. Ghinita, G., Teo, Y.: An adaptive stabilization framework for distributed hash tables. In: Proc. of IEEE IPDPS, Rhodes Island, Greece, IEEE Computer Society Press, Los Alamitos (2006)

    Google Scholar 

  13. Binzenhöfer, A., Staehle, D., Henjes, R.: On the Fly Estimation of the Peer Population in a Chord-based P2P System. In: 19th International Teletraffic Congress (ITC19), Beijing, China (2005)

    Google Scholar 

  14. Mahajan, R., Castro, M., Rowstron, A.: Controlling the cost of reliability in peer-to-peer overlays. In: Kaashoek, M.F., Stoica, I. (eds.) IPTPS 2003. LNCS, vol. 2735, Springer, Heidelberg (2003)

    Google Scholar 

  15. Stephens, M.A.: Edf statistics for goodness of fit and some comparisons. Journal of the American Statistical Association 69, 730–739 (1974)

    Article  Google Scholar 

  16. Chen, E.J., Kelton, W.D.: Quantile and histogram estimation. In: Proc. of 33nd Winter Simulation Conference, Washington, DC (2001)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. University of Würzburg, Institute of Computer Science, Chair of Distributed Systems, Würzburg, Germany

    Andreas Binzenhöfer

  2. Graduate School of Information Science and Technology, Osaka University, 1-5 Yamadaoka, Suita, Osaka 565-0871, Japan

    Kenji Leibnitz

Authors
  1. Andreas Binzenhöfer
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Kenji Leibnitz
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Lorne Mason Tadeusz Drwiega James Yan

Rights and permissions

Reprints and permissions

Copyright information

© 2007 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Binzenhöfer, A., Leibnitz, K. (2007). Estimating Churn in Structured P2P Networks. In: Mason, L., Drwiega, T., Yan, J. (eds) Managing Traffic Performance in Converged Networks. ITC 2007. Lecture Notes in Computer Science, vol 4516. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-72990-7_56

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-72990-7_56

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-72989-1

  • Online ISBN: 978-3-540-72990-7

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation