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.
This work was partially supported by the Future & Emerging Technologies unit of the European Commission through Project BISON (IST-2001-38923).
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Albert, R., Barabasi, A.-L.: Statistical Mechanics of Complex Networks. Reviews of Modern Physics 74(1), 47–97 (2001)
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)
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)
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)
Eugster, P.T., Guerraoui, R.: Probabilistic Multicast. In: Proc. Int’l Conf. Dependable Systems and Networks, IEEE Computer Society Press, Los Alamitos (2002)
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)
Ganesh, A., Kermarrec, A.-M., Massoulié, L.: Peer-to-Peer Membership Management for Gossip-based Protocols. IEEE Trans. Comp. 52(2), 139–149 (2003)
Jelasity, M., van Steen, M.: Large-Scale Newscast Computing on the Internet. Technical Report IR-503, Vrije Universiteit, Department of Computer Science (October 2002)
Kermarrec, A.-M., Massoulié, L., Ganesh, A.: Probabilistic Reliable Dissemination in Large-Scale Systems. IEEE Trans. Par. Distr. Syst. 14(3), 248–258 (2003)
Ratnasamy, S.P.: A Scalable Content Addressable Network. PhD thesis, University of California at Berkeley (October 2002)
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)
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)
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)
Watts, D.J.: Small Worlds, The Dynamics of Networks between Order and Randomness. Princeton University Press, Princeton (1999)
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)
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)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2004 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Voulgaris, S., Jelasity, M., van Steen, M. (2004). A Robust and Scalable Peer-to-Peer Gossiping Protocol. In: Moro, G., Sartori, C., Singh, M.P. (eds) Agents and Peer-to-Peer Computing. AP2PC 2003. Lecture Notes in Computer Science(), vol 2872. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-25840-7_6
Download citation
DOI: https://doi.org/10.1007/978-3-540-25840-7_6
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-24053-2
Online ISBN: 978-3-540-25840-7
eBook Packages: Computer ScienceComputer Science (R0)