An Epidemic Protocol for Managing Routing Tables in Very Large Peer-to-Peer Networks

  • Spyros Voulgaris
  • Maarten van Steen
Part of the Lecture Notes in Computer Science book series (LNCS, volume 2867)


Building self-maintained overlay networks for message routing has recently attracted significant research interest [5, 6, 7, 8, 9]. All suggested solutions have a common goal: To build and maintain structures (routing tables) that can be used to route messages. Several of the proposed algorithms focus on efficiency of bandwidth usage. However, their behavior is uncertain in the presence of highly dynamic environments, or serious disasters (i.e. half of the nodes crashing). In this paper we present an alternative approach to managing routing tables for peer-to-peer routing overlay networks, based on the Newscast epidemic protocol [1]. We substantiate our claims by presenting experimental results. We, therefore, demonstrate the potential of the Newscast epidemic protocol to create highly robust, self-administered overlay networks, able to sustain and adapt fast to severe network changes.


Overlay Network Small World Average Path Length Distribute Hash Table Cache Size 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


  1. 1.
    Jelasity, M., van Steen, M.: Large-scale newscast computing on the Internet. Technical Report IR-503, Vrije Universiteit Amsterdam, Department of Computer Science, Amsterdam, The Netherlands (October 2002)Google Scholar
  2. 2.
    Demers, A., Greene, D., Hauser, C., Irish, W., Larson, J., Shenker, S., Sturgis, H., Swinehart, D., Terry, D.: Epidemic algorithms for replicated database management. In: Proc. 6th ACM Symp. Principles of Distributed Computing (PODC 1987), Vancouver, August 1987, pp. 1–12 (1987)Google Scholar
  3. 3.
    Ganesh, A.J., Kermarrec, A.-M., Massoulié, L.: Peer-to-peer membership management for gossip-based protocols. IEEE Transactions on Computers 52(2), 139–149 (2003)CrossRefGoogle Scholar
  4. 4.
    Voulgaris, S., Jelasity, M., van Steen, M.: A Robust and Scalable Peer-to-Peer Gossiping Protocol. In: Agents and Peer-to-Peer Computing workshop, Melbourne, Australia (July 2003)Google Scholar
  5. 5.
    Ratnasamy, S., Francis, P., Handley, M., Karp, R., Shenker, S.: A scalable contentaddressable network. In: Proc. ACM SIGCOMM 2001, San Diego, CA (August 2001)Google Scholar
  6. 6.
    Stoica, I., Morris, R., Karger, D., Kaashoek, M.F., Balakrishnan, H.: Chord: A scalable peer-to-peer lookup service for Internet applications. In: Proc. ACM SIGCOMM 2001, San Diego, CA (August 2001)Google Scholar
  7. 7.
    Rowstron, A., Druschel, P.: Pastry: Scalable, decentralized object location and routing for large-scale peer-to-peer systems. In: Guerraoui, R. (ed.) Middleware 2001. LNCS, vol. 2218, p. 329. Springer, Heidelberg (2001)CrossRefGoogle Scholar
  8. 8.
    Zhao, B., Kubiatowicz, J., Joseph, A.: Tapestry: An infrastructure for faultresilient wide-area location and routing. Technical Report UCB//CSD-01-1141, U. C. Berkeley, CA (April 2001)Google Scholar
  9. 9.
    Balakrishnan, H., Kaashoek, M.F., Karger, D., Morris, R., Stoica, I.: Looking up data in P2P systems. Comm. ACM 46(2), 43–48 (2003)CrossRefGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2003

Authors and Affiliations

  • Spyros Voulgaris
    • 1
  • Maarten van Steen
    • 1
  1. 1.Vrije UniversiteitAmsterdam

Personalised recommendations