Brief announcement: performance analysis of cyclon, an inexpensive membership management for unstructured p2p overlays

Authors:
François Bonnet;Frédéric Tronel;Spyros Voulgaris
Affiliations:
École Normale Supérieure de Cachan/IRISA, Rennes, France;IRISA, Rennes, France;Department of Computer Science, ETH Zurich, Zurich, Switzerland
Venue:
DISC'06 Proceedings of the 20th international conference on Distributed Computing
Year:
2006

Citing 4
Cited 2

Asynchronous consensus and broadcast protocols

Journal of the ACM (JACM)
Fast deterministic consensus in a noisy environment

Proceedings of the nineteenth annual ACM symposium on Principles of distributed computing
Randomized protocols for asynchronous consensus

Distributed Computing - Papers in celebration of the 20th anniversary of PODC
Rapidly Mixing Markov Chains with Applications in Computer Science and Physics

Computing in Science and Engineering

Compositional gossip: a conceptual architecture for designing gossip-based applications

ACM SIGOPS Operating Systems Review - Gossip-based computer networking
Biased selection for building small-world networks

OPODIS'10 Proceedings of the 14th international conference on Principles of distributed systems

Quantified Score

Hi-index	0.00

Visualization

Abstract

Unstructured overlays form an important class of peer-to-peer networks, notably for content-based searching algorithms. Being able to build overlays with low diameter, that are resilient to unpredictable joins and leaves, in a totally distributed manner is a challenging task. Random graphs exhibit such properties, and have been extensively studied in literature. Cyclon algorithm is an inexpensive gossip-based membership management protocol described in detail in [1] that meets these requirements.