Dynamics of gossip-like information dissemination in complex computer networks

International Journal of Computer Mathematics

Volumn 85, Issue 8, 2008, Pages 1165-1173

  Nekovee, Maziar ^a,b   Moreno, Yamir ^c  

^a MARTLESHAM HEATH   (United Kingdom)

^b UNIVERSITY COLLEGE LONDON   (United Kingdom)

^c UNIVERSITY OF ZARAGOZA   (Spain)

Author keywords

Complex networks; Distributed computing; Gossip protocls; Stochastic procecess

Indexed keywords

DEGREE DISTRIBUTIONS; GOSSIP PROTOCLS; NETWORK STRUCTURES; PROTOTYPE MODELS; SCALE-FREE NETWORK TOPOLOGY; STATIC NETWORKS; STOCHASTIC PROCECESS; TIME-DEPENDENT NETWORKS;

COMPLEX NETWORKS; DISTRIBUTED COMPUTER SYSTEMS; DISTRIBUTED PARAMETER NETWORKS; DYNAMICS; ELECTRIC NETWORK TOPOLOGY; HETEROGENEOUS NETWORKS; INFORMATION DISSEMINATION; MOBILE AD HOC NETWORKS; MONTE CARLO METHODS;

COMPUTER SIMULATION;

EID: 47249153930     PISSN: 00207160     EISSN: 10290265     Source Type: Journal    
DOI: 10.1080/00207160701763065     Document Type: Article

References (21)

1. L.A. Adamic et al., Search in power-law networks, Phys. Rev. E 64 (2003), pp. 046135-046138.
2. R. Albert and A.-L. Barabási, Statistical mechanics of complex networks, Rev. Mod. Phys. 74 (2002), pp. 450-512.
3. A.-L. Barabási and R. Albert, Emergence of scaling in random networks, Science 286 (1999), pp. 509-512.
4. K.P. Birman et al., Bimodal multicast, ACM Trans. Compu. Syst. 17(2) (1999), pp. 41-88.
5. S. Boccaletti et al., Complex networks: Structure and dynamics, Phys. Rep. 424 (2006), pp. 175-308.
6. J. Dall and M. Christensen, Random geometric graphs, Phys. Rev. E. 66(2002), 0161121, pp. 1-9.
7. A. Demersetal., Epidemic algorithms for replicated database maintenence, Proc. of the 6th Annual ACM Symposium on Principles of Distributed Computing, Vancouver, Canada, 1987.
8. P.T. Eugster et al., Epidemic information dissemination in distributed systems, IEEE Computer Mag. 20 (2004), pp. 60-67.
9. R. Hekmat, Adhoc Networks: Fundamental Properties and Network Topologies, Springer, Dordrecht, The Netherlands, 2006.
10. A.-M. Kermarrec, L. Massouli, and A.J. Ganesh, Probabilistic reliable dissemination in large-scale systems, IEEE Trans. Parallel Distrib. Syst. 14 (2003), pp. 1-11.
11. Y. Moreno, M. Nekovee, and A. Vespignani, Efficiency and reliability of epidemic data dissemination in complex networks, Phys. Rev. E. 69 (2004), 055101 (R), pp. 1-4.
12. M. Nekovee et al., Theory of rumour spreading in complex social networks, Physica A. 374 (2007), pp. 457-470.
13. M. Nekovee, Worm epidemics in wireless adhoc networks, New. J. Phys. 9 (2007), pp. 189-192.
14. M.E.J. Newman, The structure and function of complex networks, SIAM Rev. 45 (2003), pp. 167-256.
15. A. Oram, (ed.), Peer-to-peer: Harnessing the Power of Disruptive. Technologies, O'Reilly and Associates, New York, 2001.
16. J. Park and M.E. Newman, Statistical mechanics of networks, Phys. Rev. E. 70 (2004), 066117, pp. 1-13.
17. R. Pastor-Satorras and A. Vespignani, Epidemic spreading in scale-free networks, Phys. Rev. Lett. 86 (2001), pp. 3200-3204.
18. M. Penrose, Random Geometric Graphs, Oxford University Press, Oxford, 2003.
19. G. Siganos et al., Power laws and the AS-level internet topology, IEEE/ACM Trans. Netw. 11 (2003), pp. 514-524.
20. W. Vogels, R. Van Renesse, and K.P. Birman, The power of epidemics: robust communication for large-scale distributed systems, ACM SIGCOMM Compu. Commun. Rev. 33 (2003), pp. 131-135.
21. D.J. Watts and S. Strogatz, Collective dynamics of small-world networks, Nature 393 (2003), pp. 393-395.