CYCLON: Inexpensive Membership Management for Unstructured P2P Overlays

CYCLON: Inexpensive Membership Management for Unstructured P2P Overlays (2005)

Cached

Download Links

Other Repositories/Bibliography

DBLP

by Spyros Voulgaris , Daniela Gavidia , Maarten Van Steen

Venue:	Journal of Network and Systems Management
Citations:	154 - 20 self

BibTeX

@ARTICLE{Voulgaris05cyclon:inexpensive,
    author = {Spyros Voulgaris and Daniela Gavidia and Maarten Van Steen},
    title = {CYCLON: Inexpensive Membership Management for Unstructured P2P Overlays},
    journal = {Journal of Network and Systems Management},
    year = {2005},
    volume = {13},
    pages = {2005}
}

Years of Citing Articles

Bookmark

OpenURL

Abstract

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. KEY WORDS: Membership management; peer-to-peer; epidemic/gossiping protocols; unstructured overlays; random graphs.

Citations

1796	On generalized graphs - BOLLOBAS - 1965
1397	Pastry: Scalable, decentralized object location and routing for large-scale peer-to-peer systems - Rowstron, Druschel - 2001
1186	Statistical mechanics of complex networks - Albert, Barabasi - 2002
239	Lightweight probabilistic broadcast - EUGSTER, GUERRAOUI, et al.
170	Looking up data in P2P systems - Balakrishnan, Kaashoek, et al.
167	Peer-to-peer membership management for gossip-based protocols - Ganesh, Kermarrec, et al. - 2003
142	The peer sampling service: experimental evaluation of unstructured gossip-based implementations - JELASITY, GUERRAOUI, et al.
108	Building Low-Diameter P2P Networks - Pandurangan, Raghavan, et al. - 2001
90	A lightweight, robust, P2P system to handle Flash Crowds - Stavrou, Rubenstein, et al. - 2004
77	Distributed construction of random expander networks - Law, Siu - 2003
61	Random graphs as models of networks - Newman - 2003
59	Newscast computing - Jelasity, Kowalczyk, et al. - 2003
53	Epidemic-style Management of Semantic Overlays for Content-Based Searching - Voulgaris, Steen - 2005
30	A robust and scalable peer-to-peer gossiping protocol - Voulgaris, Jelasity, et al. - 2004
29	An epidemic protocol for managing routing tables in very large peer to peer networks - Voulgaris, Steen - 2003
29	Random Graphs, 2nd edn - Bollobás - 2001
23	Supporting resilient low-diameter peer-to-peer topologies - Wouhaybi, Campbell, et al.
19	Scalable cooperative latency estimation - Szymaniak, Pierre, et al. - 2004
17	Newscast em - Kowalczyk, Vlassis - 2004
2	A Robust and Scalable Peer-to-Peer Gossiping - Voulgaris, Jelasity, et al.
1	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 - Szymaniak, Pierre, et al.