Advertisement

Journal of Network and Systems Management

, Volume 13, Issue 2, pp 197–217 | Cite as

CYCLON: Inexpensive Membership Management for Unstructured P2P Overlays

  • Spyros Voulgaris
  • Daniela Gavidia
  • Maarten van Steen
Article

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.

Keywords

Membership management peer-to-peer epidemic/gossiping protocols unstructured overlays random graphs 

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    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.Google Scholar
  2. 2.
    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.Google Scholar
  3. 3.
    R. Albert and A.-L. Barabasi, Statistical mechanics of complex networks, Reviews of Modern Physics, Vol. 74, No. 1, pp. 47–97, 2001.Google Scholar
  4. 4.
    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.Google Scholar
  5. 5.
    B. Bollobas, Random Graphs, 2nd edn., Cambridge University Press, Cambridge, UK, 2001.Google Scholar
  6. 6.
    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.Google Scholar
  7. 7.
    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.Google Scholar
  8. 8.
    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.Google Scholar
  9. 9.
    M. Jelasity, W. Kowalczyk, and M. van Steen, Newscast computing, Technical Report IR-CS-006, Vrije Universiteit Amsterdam, Department of Computer Science, 2003.Google Scholar
  10. 10.
    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.Google Scholar
  11. 11.
    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.Google Scholar
  12. 12.
    W. Kowalczyk and N. Vlassis, Newscast EM. In Advances in Neural Information Processing Systems (NIPS), Vol. 17, MIT Press, Cambridge, MA, 2005.Google Scholar
  13. 13.
    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.Google Scholar
  14. 14.
    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.Google Scholar
  15. 15.
    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.Google Scholar
  16. 16.
    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.Google Scholar
  17. 17.
    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.Google Scholar
  18. 18.
    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.Google Scholar

Copyright information

© Springer Science + Business Media, Inc. 2005

Authors and Affiliations

  • Spyros Voulgaris
    • 1
  • Daniela Gavidia
    • 1
  • Maarten van Steen
    • 1
  1. 1.Computer Science DepartmentVrije Universiteit AmsterdamAmsterdamThe Netherlands

Personalised recommendations