An analytical model of information dissemination for a gossip-based protocol

Computer Networks

Volumn 53, Issue 13, 2009, Pages 2288-2303

  Bakhshi, Rena ^a   Gavidia, Daniela ^a   Fokkink, Wan ^a   van Steen, Maarten ^a  

^a VU UNIVERSITY AMSTERDAM   (Netherlands)

Author keywords

Gossip based protocols; Large scale networks; Probabilistic analysis

Indexed keywords

ANALYTICAL MODEL; GOSSIP-BASED PROTOCOL; GOSSIP-BASED PROTOCOLS; GOSSIPING PROTOCOLS; LARGE SCALE SIMULATIONS; LARGE-SCALE NETWORKS; OPTIMAL SIZE; PROBABILISTIC ANALYSIS; PULL AND PUSH APPROACH;

COMPUTER SIMULATION;

INFORMATION DISSEMINATION;

EID: 67650427144     PISSN: 13891286     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.comnet.2009.03.017     Document Type: Article

References (29)

1. Abramowitz M., and Stegun I.A. Handbook of Mathematical Functions with Formulas, Graphs, and Mathematical Tables. ninth ed. (1972), Dover, New York
2. A. Allavena, A. Demers, J.E. Hopcroft, Correctness of a gossip based membership protocol, in: Proc. PODC'05, ACM, 2005, pp. 292-301.
3. S. Assaf, P. Diaconis, K. Soundararajan., A rule of thumb for riffle shuffling, Tech. rep., Stanford University, 2008.
4. Bailey N.T. Mathematical Theory of Infectious Diseases and Its Applications. second ed. (1975), Griffin, London
5. Bakhshi R., Bonnet F., Fokkink W., and Haverkort B. Formal analysis techniques for gossiping protocols. ACM SIGOPS Oper. Syst. Rev. 41 5 (2007) 28-36
6. R. Bakhshi, D. Gavidia, W. Fokkink, M. van Steen, An analytical model of information dissemination for a gossip-based protocol, in: Proc. Conf. on Distributed Computing and Networking (ICDCN 2009), LNCS, vol. 5408, Springer, 2009, pp. 230-242.
7. Bayer D., and Diaconis P. Trailing the dovetail shuffle to its lair. Ann. Appl. Probab. 2 2 (1992) 294-313
8. F. Bonnet, Performance analysis of Cyclon, an inexpensive membership management for unstructured P2P overlays, Master Thesis, ENS Cachan Bretagne, University of Rennes, IRISA, 2006.
9. S. Boyd, A. Ghosh, B. Prabhakar, D. Shah, Gossip algorithms: design, analysis and applications, in: Proc. INFOCOM'05, vol. 3, IEEE, 2005, pp. 1653-1664.
10. Daley D.J., and Gani J. Epidemic Modelling: An Introduction (1999), Cambridge University Press, Cambridge, UK
11. Deb S., Médard M., and Choute C. Algebraic gossip: a network coding approach to optimal multiple rumor mongering. IEEE/ACM TON 14 SI (2006) 2486-2507
12. A. Demers, D. Greene, C. Hauser, W. Irish, J. Larson, S. Shenker, H. Sturgis, D. Swinehart, D. Terry, Epidemic algorithms for replicated database maintenance, in: Proc. 6th Annu. ACM Symp. on Principles of Distributed Computing (PODC'87), ACM Press, 1987, pp. 1-12.
13. Dempster A.P., Laird N.M., and Rubin D.B. Maximum likelihood from incomplete data via the EM algorithm. J. Roy. Statist. Soc. B 39 (1977) 1-38
14. N. Drost, E. Ogston, R. van Nieuwpoort, H. Bal, ARRG: Real-World Gossiping, in: Proc. 15th Symp. on High Performance Distributed Computing (HPDC-15'06), ACM, 2007, pp. 147-158.
15. Eugster P., Guerraoui R., Handurukande S., Kermarrec A.-M., and Kouznetsov P. Lightweight probabilistic broadcast. ACM TOCS 21 4 (2003) 341-374
16. Eugster P.T., Guerraoui R., Kermarrec A.-M., and Massoulié L. From epidemics to distributed computing. IEEE Comput. 37 5 (2004) 60-67
17. D. Gavidia, S. Voulgaris, M. van Steen, A gossip-based distributed news service for wireless mesh networks, in: Proc. WONS'06, IEEE, 2006, pp. 59-67.
18. M. Gilleland, Working with Fractions in Java, 2002. URL: .
19. Gupta I., Nagda M., and Devaraj C.F. The design of novel distributed protocols from differential equations. Distrib. Comput. 20 2 (2007) 95-114
20. Hilton P., Holton D., and Pedersen J. Mathematical Reflections (1997), Springer-Verlag, New York
21. Jelasity M., Montresor A., and Babaoglu O. Gossip-based aggregation in large dynamic networks. ACM Trans. Comput. Syst. 23 3 (2005) 219-252
22. Jelasity M., Voulgaris S., Guerraoui R., Kermarrec A.-M., and van Steen M. Gossip-based peer sampling. ACM TOCS 25 3 (2007) 8
23. R. Karp, C. Schindelhauer, S. Shenker, B. Vocking, Randomized rumor spreading, in: Proc. FOCS'00, IEEE, 2000, pp. 565-574.
24. D. Kempe, A. Dobra, J. Gehrke, Gossip-based computation of aggregate information, in: Proc. 44th Annu. IEEE Symp. on Found. of Comput. Sci., IEEE, 2003, pp. 482-491.
25. Ko S.Y., Gupta I., and Jo Y. A new class of nature-inspired algorithms for self-adaptive peer-to-peer computing. ACM Trans. Auton. Adapt. Syst. 3 3 (2008) 1-34
26. McLachlan G.J., and Peel D. Finite Mixture Models (2000), John Wiley & Sons
27. Mitzenmacher M. The power of two choices in randomized load balancing. IEEE Trans. Parallel Distrib. Syst. 12 10 (2001) 1094-1104
28. Graham R., Knuth D., and Potashnik O. Concrete Mathematics. second ed. (1994), Addison-Wesley
29. Voulgaris S., Gavidia D., and van Steen M. Cyclon: Inexpensive membership management for unstructured P2P overlays. Network Syst. Manag. 13 2 (2005) 197-217