DMCA
CYCLON: Inexpensive Membership Management for Unstructured P2P Overlays (2005)
Cached
Download Links
| Venue: | Journal of Network and Systems Management |
| Citations: | 213 - 24 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}
}
Share
 |
 |
 |
 |
||
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.
Keyphrases
inexpensive membership management unstructured p2p overlay low diameter massive node failure high node churn novel gossip-based membership management protocol membership management content-based searching random graph random-graph property peer-to-peer network unstructured overlay membership management issue important class epidemic gossiping protocol large number low clustering high-frequency membership change symmetric node degree key word characteristic property
