A Robust and Scalable Peer-to-Peer Gossiping Protocol

  • Spyros Voulgaris
  • Márk Jelasity
  • Maarten van Steen
Part of the Lecture Notes in Computer Science book series (LNCS, volume 2872)

Abstract

The newscast model is a general approach for communication in large agent-based distributed systems. The two basic services—membership management and information dissemination—are implemented by the same epidemic-style protocol. In this paper we present the newscast model and report on experiments using a Java implementation. The experiments involve communication in a large, wide-area cluster computer. By analysis of the outcome of the experiments we demonstrate that the system indeed shows the scalability and dependability properties predicted by our previous theoretical and simulation results.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Albert, R., Barabasi, A.-L.: Statistical Mechanics of Complex Networks. Reviews of Modern Physics 74(1), 47–97 (2001)CrossRefMathSciNetGoogle Scholar
  2. 2.
    Castro, M., Druschel, P., Hu, Y.C., Rowstron, A.: Exploiting Network Proximity in Peer-to-Peer Overlay Networks. Technical Report MSR-TR-2002-82, Microsoft Research, Cambridge, UK (June 2002)Google Scholar
  3. 3.
    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. Sixth Symp. on Principles of Distributed Computing, pp. 1–12. ACM Press, New York (1987)CrossRefGoogle Scholar
  4. 4.
    Eugster, P., Guerraoui, R., Handurukande, S., Kermarrec, A.-M., Kouznetsov, P.: Lightweight Probabilistic Broadcast. In: Proc. Second Int’l Conf. Dependable Systems and Networks, pp. 443–452. IEEE Computer Society Press, Los Alamitos (2001)CrossRefGoogle Scholar
  5. 5.
    Eugster, P.T., Guerraoui, R.: Probabilistic Multicast. In: Proc. Int’l Conf. Dependable Systems and Networks, IEEE Computer Society Press, Los Alamitos (2002)Google Scholar
  6. 6.
    Ganesh, A., Kermarrec, A.-M., Massoulié, L.: Scamp: Peer-to-Peer Lightweight Membership Servic for Large-Scale Group Communication. In: Crowcroft, J., Hofmann, M. (eds.) NGC 2001. LNCS, vol. 2233, pp. 44–56. Springer, Heidelberg (2001)CrossRefGoogle Scholar
  7. 7.
    Ganesh, A., Kermarrec, A.-M., Massoulié, L.: Peer-to-Peer Membership Management for Gossip-based Protocols. IEEE Trans. Comp. 52(2), 139–149 (2003)CrossRefGoogle Scholar
  8. 8.
    Jelasity, M., van Steen, M.: Large-Scale Newscast Computing on the Internet. Technical Report IR-503, Vrije Universiteit, Department of Computer Science (October 2002)Google Scholar
  9. 9.
    Kermarrec, A.-M., Massoulié, L., Ganesh, A.: Probabilistic Reliable Dissemination in Large-Scale Systems. IEEE Trans. Par. Distr. Syst. 14(3), 248–258 (2003)CrossRefGoogle Scholar
  10. 10.
    Ratnasamy, S.P.: A Scalable Content Addressable Network. PhD thesis, University of California at Berkeley (October 2002)Google Scholar
  11. 11.
    Rowstron, A., Druschel, P.: Pastry: Scalable, Distributed Object Location and Routing for Large-Scale Peer-to-Peer Systems. In: Guerraoui, R. (ed.) Middleware 2001. LNCS, vol. 2218, pp. 329–350. Springer, Heidelberg (2001)CrossRefGoogle Scholar
  12. 12.
    Stoica, I., Morris, R., Karger, D., Kaashoek, M.F., Balakrishnan, H.: Chord: A Scalable Peer-to-peer Lookup Service for Internet Applications. In: Proc. SIGCOMM, ACM, New York (2001)Google Scholar
  13. 13.
    Stoica, I., Morris, R., Liben-Nowell, D., Karger, D.R., Kaashoek, M.F., Dabek, F., Balakrishnan, H.: Chord: A Scalable Peer-to-peer Lookup Protocol for Internet Applications. IEEE/ACM Trans. Netw. (2003) (to appear)Google Scholar
  14. 14.
    Watts, D.J.: Small Worlds, The Dynamics of Networks between Order and Randomness. Princeton University Press, Princeton (1999)Google Scholar
  15. 15.
    Yang, B., Garcia-Molina, H.: Designing a Super-Peer Network. In: Proc. 19th Int’l Conf. Data Engineering, IEEE Computer Society Press, Los Alamitos (2003)Google Scholar
  16. 16.
    Zhao, B.Y., Kubiatowicz, J., Joseph, A.D.: Tapestry: An Infrastructure for Fault-tolerant Wide-area Location and Routing. Technical Report CSD-01-1141, Computer Science Division, University of California, Berkeley (April 2001)Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2004

Authors and Affiliations

  • Spyros Voulgaris
    • 1
  • Márk Jelasity
    • 2
  • Maarten van Steen
    • 1
  1. 1.Department Computer ScienceFaculty of Sciences, Vrije Universiteit AmsterdamThe Netherlands
  2. 2.Department of Computer ScienceUniversity of BolognaItaly

Personalised recommendations