Skip to main content

Churn Resilience of Peer-to-Peer Group Membership: A Performance Analysis

  • Conference paper
Distributed Computing – IWDC 2005 (IWDC 2005)

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 3741))

Included in the following conference series:

Abstract

Partitioning is one of the main problems in p2p group membership. This problem rises when failures and dynamics of peer participation, or churn, occur in the overlay topology created by a group membership protocol connecting the group of peers. Solutions based on Gossip-based Group Membership (GGM) cope well with the failures while suffer from network dynamics. This paper shows a performance evaluation of SCAMP, one of the most interesting GGM protocol. The analysis points out that the probability of partitioning of the overlay topology created by SCAMP increases with the churn rate. We also compare SCAMP with DET – another membership protocol that deterministically avoids partitions of the overlay. The comparison points out an interesting trade-off between (i) reliability, in terms of guaranteeing overlay connectivity at any churn rate, and (ii) scalability in terms of creating scalable overlay topologies where latencies experienced by a peer during join and leave operations do not increase linearly with the number of peers in the group.

The work described in this paper was partially supported by the Italian Ministry of Education, University, and Research (MIUR) under the IS-MANET project.

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

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 109.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Allavena, A., Demers, A., Hopcroft, J.E.: Correctness of a Gossip Based Membership Protocol. In: Proceedings of ACM Conference on Principles of Distributed Computing (2005)

    Google Scholar 

  2. Baldoni, R., Piergiovanni, S.T.: Group Membership for Peer-to-Peer Communication, Technical Report (May 2005), available on, http://www.dis.uniroma1.it/~midlab/publications

  3. Baldoni, R., Mian, A.N., Scipioni, S., Piergiovanni, S.T.: Churn Resilience of Peer-to-Peer Group Membership: a Performance Analysis, Technical Report (May 2005), available on, http://www.dis.uniroma1.it/~midlab/publications

  4. Basu, A., Charron-Bost, B., Toeug, S.: Simulating Reliable Links with Unreliable Links in the Presence of Process Crashes. In: Proceedings of the 10th International Workshop on Distributed Algorithms, pp. 105–122 (1996)

    Google Scholar 

  5. Birman, K., van Renesse, R.: Reliable Distributed Computing with the Isis Toolkit. IEEE Computer Society Press, Los Alamitos (1994)

    Google Scholar 

  6. Castro, M., Druschel, P., Kermarrec, A.-M., Rowstron, A.: Scribe: A Large-scale and Decentralized Application-level Multicast Infrastructure. In: IEEE Journal on Selected Areas in communications (2002)

    Google Scholar 

  7. Chockler, G., Keidar, I., Vitenberg, R.: Group Communication Specifications: a Comprehensive Study. ACM Comput. Surv. 33(4), 427–469 (2001)

    Article  Google Scholar 

  8. Cristian, F.: Reaching Agreement on Processor Group Membership in Synchronous Distributed Systems. Distributed Computing 4(4), 175–187 (1991)

    Article  MATH  Google Scholar 

  9. Eugster, P.T., Guerraoui, R., Handurukande, S.B., Kouznetsov, P., Kermarrec, A.-M.: Lightweight Probabilistic Broadcast. ACM Trans. Comput. Syst. 21(4), 341–374 (2003)

    Article  Google Scholar 

  10. Ganesh, A.J., Kermarrec, A.-M., Massoulié, L.: Peer-to-Peer Membership Management for Gossip-Based Protocols. IEEE Trans. Computers 52(2), 139–149 (2003)

    Article  Google Scholar 

  11. Jelasity, M., Guerraoui, R., Kermarrec, A.-M., van Steen, M.: The Peer Sampling Service: Experimental Evaluation of Unstructured Gossip-Based Implementations. In: Jacobsen, H.-A. (ed.) Middleware 2004. LNCS, vol. 3231, pp. 79–98. Springer, Heidelberg (2004)

    Chapter  Google Scholar 

  12. Jannotti, J., Gifford, D.K., Johnson, K.L., Kaashoek, M.F., O’Toole, J.W.: Overcast: Reliable Multicasting with an Overlay Network. In: Proceedings of 4th Symposium on Operating System Design and Implementation (2000)

    Google Scholar 

  13. Liben-Nowell, D., Balakrishnan, H., Karger, D.: Analysis of the Evolution of Peer-to-Peer Systems. In: Proceedings of ACM Conference on Principles of Distributed Computing (2002)

    Google Scholar 

  14. Ns-2 simulator, http://www.isi.edu/nsnam/ns

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2005 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Baldoni, R., Mian, A.N., Scipioni, S., Tucci-Piergiovanni, S. (2005). Churn Resilience of Peer-to-Peer Group Membership: A Performance Analysis. In: Pal, A., Kshemkalyani, A.D., Kumar, R., Gupta, A. (eds) Distributed Computing – IWDC 2005. IWDC 2005. Lecture Notes in Computer Science, vol 3741. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11603771_26

Download citation

  • DOI: https://doi.org/10.1007/11603771_26

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-30959-8

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

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics