Abstract
Epidemic algorithms can propagate information in a large scale network, that changes arbitrarily, in a self-organizing way. This type of spreading process allows rapid dissemination of information to all network nodes. However, the dynamics of epidemic algorithms can be strongly influenced by the network topology. In this paper, numerical simulations are used to illustrate such influences. We address networks with simple topologies for simplicity and in order to isolate other effects that occur in more complex networks.
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.
Similar content being viewed by others
References
Adya, A.: Weak Consistency: A Generalized Theory and Optimistic Implementations for Distributed Transactions, PhD thesis M. I. T., Department of Electrical Engineering and Computer Science (March 1999)
Foster, I., Kesselman, C., Tuecke, S.: The Anatomy of the Grid: Enabling Scalable Virtual Organizations International J. Supercomputer Applications 15(3) (2001)
Golding, R.A.: ”Weak-Consistency Group Communication and Membership”, PhD thesis, University of California, Santa Cruz, Computer and Information Sciences Technical Report UCSC-CRL-92-52 (December 1992)
Guy, R., Heidemann, J., Mak, W., Page Jr., T., Popek, G., Rothmeier, D.: Implementation of the Ficus Replicated File System. In: Proceedings Summer USENIX Conf. (June 1990)
Holliday, J., Agrawal, D., El Abbadi, A.: Partial Database Replication using Epidemic Communication. In: Proceedings of the 22 nd International Conference on Distributed Computing Systems, ICDCS 2002 (2002)
Kantor, B.: Phil Lapsley RFC0977 (1986), http://www.ietf.org/rfc/rfc0977.txt
Li, L., Halpern, J., Hass, Z.J.: Gossip-based ad hoc routing. In: Proceedings of Infocom, pp. 1707–1716 (2002)
The Network Simulator: http://www.isi.edu/nsnam/ns/
Petersen, K., Spreitzer, M.J., Terry, D.B., Theimer, M.M., Demers: Flexible Update Propagation for Weakly Consistent Replication. In: Proceedings of the 16th ACM Symposium on Operating Systems Principles (SOSP-16), Saint Malo, France, October 5-8, pp. 288–301 (1997)
Satyanarayanan, M.: Scalable, Secure, and Highly Available Distributed File. IEEE Computer 23(5) (May 1990)
Schroeder, M.D., Birrel, A.D., Needham, R.M.: Experience with Grapevine: The Growth of a Distributed System. ACM Transactions of Computer Systems 2(1), 3–23 (1984)
Pastor-Satorras, R., Vespignant, A.: Epidemic Spreading in Scale Free Networks. Physica Review Letters 86 (2001)
Willinger, W., Govindan, R., Jamin, S., Paxson, V., Shenker, S.: Scaling phenomena in the Internet: Critically examining criticality. PNAS 99(suppl.), 2573–2580 (2002)
Pool, I., Kochen, M.: Contacts and influence. Social Networks 1(5), 51 (1978)
Wu, F., Huberman, B.A., Adamic, L.A., Tyler, J.R.: Information Flow in Social Groups. annual CNLS conference on Networks, Santa Fe, NM, May 12 (2003), http://www.hpl.hp.com/shl/papers/flow/
Cuenca-Acuna, F.M., Peery, C., Martin, R.P., Nguyen, T.D.: PlanetP: Using Gossiping to Build Content Addressable Peer-to-Peer Information Sharing Communities. In: Proc. of the IEEE International Symposium on High Performance Distributed Computing (HPCD 12), Seattle, WA (June 2003)
Ganesh, A., Kermarrec, A., Massoulie, L.: Peer-to-Peer Membership Management for Gossip-based Protocols. IEEE Trans. Comp. 52(2), 139–149 (2003)
Obraczka, K.: Massively Replicating Services in Wide Area Internetworks, PhD dissertation, Computer Science Department, University of Southern California (December 1994)
Lamport, L.: Time, clocks, and the ordering of events in a distributed system. Communications of the ACM 21(7), 558 (1978)
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
Acosta-Elías, J., Pineda, U., Luna-Rivera, J.M., Stevens-Navarro, E., Campos-Canton, I., Navarro-Moldes, L. (2004). The Effects of Network Topology on Epidemic Algorithms. In: Laganá, A., Gavrilova, M.L., Kumar, V., Mun, Y., Tan, C.J.K., Gervasi, O. (eds) Computational Science and Its Applications – ICCSA 2004. ICCSA 2004. Lecture Notes in Computer Science, vol 3046. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-24768-5_19
Download citation
DOI: https://doi.org/10.1007/978-3-540-24768-5_19
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-22060-2
Online ISBN: 978-3-540-24768-5
eBook Packages: Springer Book Archive