Brief Announcement: Performance Analysis of Cyclon, an Inexpensive Membership Management for Unstructured P2P Overlays
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  that meets these requirements.
KeywordsRandom Graph Outgoing Edge Discrete Time Markov Chain Broadcast Protocol Global Scheduler
Unable to display preview. Download preview PDF.
- 1.Voulgaris, S., Gavidia, D., van Steen, M.: CYCLON: Inexpensive membership management for unstructured P2P overlays. J. Network Syst. Manage. 13 (2005)Google Scholar
- 2.Aspnes, J.: Randomized protocols for asynchronous consensus. DISTCOMP: Distributed Computing 16 (2003)Google Scholar
- 3.Bracha, G., Toueg, S.: Asynchronous consensus and broadcast protocols. JACM: Journal of the ACM 32 (1985)Google Scholar
- 4.Aspnes, J.: Fast deterministic consensus in a noisy environment. In: PODC, pp. 299–308 (2000)Google Scholar
- 5.Randall, D.: Rapidly mixing Markov chains with applications in computer science and physics. Computing in Science and Engineering 8, 30–41 (2006)Google Scholar
- 6.Bonnet, F., Tronel, F., Voulgaris, S.: Performance analysis of cyclon, an inexpensive membership management for unstructured p2p overlays. Technical Report 1807, IRISA (2006)Google Scholar