Unstructured overlays form an important class of peer-to-peer networks, notably when content-based searching is at stake. The construction of these overlays, which is essentially a membership management issue, is crucial. Ideally, the resulting overlays should have low diameter and be resilient to massive node failures, which are both characteristic properties of random graphs. In addition, they should be able to deal with a high node churn (i.e., expect high-frequency membership changes). Inexpensive membership management while retaining random-graph properties is therefore important. In this paper, we describe a novel gossip-based membership management protocol that meets these requirements. Our protocol is shown to construct graphs that have low diameter, low clustering, highly symmetric node degrees, and that are highly resilient to massive node failures. Moreover, we show that the protocol is highly reactive to restoring randomness when a large number of nodes fail.
This is a preview of subscription content, access via your institution.
Buy single article
Instant access to the full article PDF.
Price includes VAT (USA)
Tax calculation will be finalised during checkout.
H. Balikrishnan, M. Frans Kaashoek, D. Karger, R. Morris, and I. Stoica, Looking up data in p2p systems, Communications ACM, Vol. 46, No. 2, pp. 43–48, 2003.
M. Jelasity, R. Guerraoui, A.-M. Kermarrec, and M. van Steen, The Peer Sampling Service: Experimental Evaluation of Unstructured Gossip-Based Implementations, Fifth ACM/IFIP/USENIX International Middleware Conference, Toronto, Canada, October 2004.
R. Albert and A.-L. Barabasi, Statistical mechanics of complex networks, Reviews of Modern Physics, Vol. 74, No. 1, pp. 47–97, 2001.
M. E. J. Newman, Random graphs as models of networks. In S. Bornholdt and H. G. Schuster (eds.), Handbook of Graphs and Networks: From the Genome to the Internet, Chapter 2, Wiley, New York, 2002.
B. Bollobas, Random Graphs, 2nd edn., Cambridge University Press, Cambridge, UK, 2001.
S. Voulgaris and M. van Steen, An Epidemic Protocol for Managing Routing Tables in Very Large Peer-to-Peer Networks. 14th IFIP/IEEE Workshop on Distributed Systems: Operations and Management (DSOM2003), Heidelberg, Germany, October 2003.
A. Stavrou, D. Rubenstein, and S. Sahu, A lightweight, robust P2P system to handle flash crowds, IEEE Journal on Selected Areas in Communications, Vol. 22, No. 1, pp. 6–17, 2004.
S. Voulgaris and M. van Steen, Epidemic-style management of semantic overlays for content-based searching, Technical Report IR-CS-011, Vrije Universiteit Amsterdam, November 2004.
M. Jelasity, W. Kowalczyk, and M. van Steen, Newscast computing, Technical Report IR-CS-006, Vrije Universiteit Amsterdam, Department of Computer Science, 2003.
S. Voulgaris, M. Jelasity, and M. van Steen, A Robust and Scalable Peer-to-Peer Gossiping Protocol, 2nd International Workshop on Agents and Peer-to-Peer Computing (AP2PC 2003), Melbourne, Australia, July 2003.
A. Rowstron and P. Druschel, Pastry: Scalable, Decentralized Object Location and Routing for Large-Scale Peer-to-Peer Systems. IFIP/ACM Middleware 2001, Heidelberg, Germany, November 2001.
W. Kowalczyk and N. Vlassis, Newscast EM. In Advances in Neural Information Processing Systems (NIPS), Vol. 17, MIT Press, Cambridge, MA, 2005.
A. J. Ganesh, A.-M. Kermarrec, and L. Massoulie, Peer-to-peer membership management for gossip-based protocols, IEEE Transactions on Computers, Vol. 52, No. 2, pp. 139–149, 2003.
P. Eugster, R. Guerraoui, S. Handurukande, A.-M. Kermarrec, and P. Kouznetsov, Lightweight probabilistic broadcast, ACM Transactions on Compute Systems, Vol. 21, No. 4, pp. 341–374, 2003.
G. Pandurangan, P. Raghavan, and E. Upfal, Building low-diameter P2P networks, IEEE Journal on Selected Areas in Communications, Vol. 21, No. 6, pp. 995–1002, 2003.
C. Law and K.-Y. Sui, Distributed Construction of Random Expander Networks, 22nd INFOCOM Conference, Los Alamitos, CA, March 2003, IEEE, IEEE Computer Society Press.
R. Wouhaybi and A. T. Campbell, Supporting Resilient Low-Diameter Peer-to-Peer Topologies, 23rd INFOCOM Conference, Los Alamitos, CA, March 2004, IEEE, IEEE Computer Society Press.
M. Szymaniak, G. Pierre, and M. van Steen, Scalable Cooperative Latency Estimation, Tenth International Conference on Parallel and Distributed Systems, Los Alamitos, CA, July 2004, IEEE, IEEE Computer Society Press.
Spyros Voulgaris is a PhD student in the Computer Systems department at the Vrije Universiteit Amsterdam. He received his MSc degree from the University of Michigan, Ann Arbor, and his BSc degree from the University of Patras, Greece. His research involves peer-to-peer systems, epidemic protocols, and ad-hoc networks. He is a scholarship recipient of the Greek State Scholarships Foundation (IKY) and the Alexander Onassis Foundation.
Daniela Gavidia is a PhD student in the Computer Systems group at the Vrije Universiteit Amsterdam. She received her MSc degree from the Universiteit van Amsterdam. Her research interests include peer-to-peer systems and ad-hoc networks. Her recent work focuses on information dissemination in ad-hoc environments.
Maarten van Steen is professor of Computer Science at the Vrije Universiteit Amsterdam. His research concentrates on large-scale distributed systems, notably content delivery networks and peer-to-peer systems. He is senior member of the IEEE and member of the ACM.
About this article
Cite this article
Voulgaris, S., Gavidia, D. & van Steen, M. CYCLON: Inexpensive Membership Management for Unstructured P2P Overlays. J Netw Syst Manage 13, 197–217 (2005). https://doi.org/10.1007/s10922-005-4441-x
- Membership management
- epidemic/gossiping protocols
- unstructured overlays
- random graphs