Abstract
We propose Gossipico, a gossip algorithm to average, sum or find minima and maxima over node values in a large, distributed, and dynamic network. Unlike previous work, Gossipico provides a continuous estimate of, for example, the number of nodes, even when the network becomes disconnected. Gossipico converges quickly due to the introduction of a beacon mechanism that directs messages to an autonomously selected beacon node. The information spread through the network shows a percolation-like phase-transition and allows information to propagate along near-shortest paths. Simulations in various different network topologies (ranging in size up to one million nodes) illustrate Gossipico’s robustness against network changes and display a near-optimal count time. Moreover, in a comparison with other related gossip algorithms, Gossipico displays an improved and more stable performance over various classes of networks.
Chapter PDF
Similar content being viewed by others
References
Demers, A., Greene, D., Hauser, C., Irish, W., Larson, J., Shenker, S., Sturgis, H., Swinehart, D., Terry, D.: Epidemic algorithms for replicated database maintenance. In: Proc. of the 6th Annual ACM Symp. on Principles of Distributed Computing, pp. 1–12 (1987)
Le Merrer, E., Kermarrec, A.M., Massoulie, L.: Peer to peer size estimation in large and dynamic networks: A comparative study. In: Proc. of the 15th IEEE Int. High Performance Distributed Computing Symp., pp. 7–17 (2006)
Kostoulas, D., Psaltoulis, D., Gupta, I., Birman, K., Demers, A.: Decentralized schemes for size estimation in large and dynamic groups. In: Proc. of the 4th IEEE Int. Network Computing and Applications Symp., pp. 41–48 (2005)
Massoulié, L., Le Merrer, E., Kermarrec, A.M., Ganesh, A.: Peer counting and sampling in overlay networks: random walk methods. In: Proc. of the 25th annual ACM Symp. on Principles of Distributed Computing, pp. 123–132 (2006)
Montresor, A., Ghodsi, A.: Towards robust peer counting. In: Proc. of the 9th IEEE Int. Conf. on Peer-to-Peer Computing, pp. 143–146 (2009)
Jelasity, M., Montresor, A.: Epidemic-style proactive aggregation in large overlay networks. In: Proc. of the 24th Int. Distributed Computing Systems Conf., pp. 102–109 (2004)
Kempe, D., Dobra, A., Gehrke, J.: Gossip-based computation of aggregate information. In: Proc. of the 44th IEEE Symp. on Foundations of Computer Science, pp. 482–491 (2003)
Guerrieri, A., Carreras, I., De Pellegrini, F., Miorandi, D., Montresor, A.: Distributed estimation of global parameters in delay-tolerant networks. Computer Communications 33, 1472–1482 (2010)
Giakkoupis, G.: Tight bounds for rumor spreading in graphs of a given conductance. In: Proc. of the 28th Symp. on Theoretical Aspects of Computer Science, pp. 57–68 (2011)
Batagelj, V., Brandes, U.: Efficient generation of large random networks. Phys. Rev. E 71(3), 036113 (2005)
Van Mieghem, P., Hooghiemstra, G., van der Hofstad, R.: A scaling law for the hopcount in internet. Technical report. Delft University of Technology (2000)
Achlioptas, D., D’Souza, R.M., Spencer, J.: Explosive percolation in random networks. Science 323(5920), 1453–1455 (2009)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2012 IFIP International Federation for Information Processing
About this paper
Cite this paper
van de Bovenkamp, R., Kuipers, F., Van Mieghem, P. (2012). Gossip-Based Counting in Dynamic Networks. In: Bestak, R., Kencl, L., Li, L.E., Widmer, J., Yin, H. (eds) NETWORKING 2012. NETWORKING 2012. Lecture Notes in Computer Science, vol 7290. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-30054-7_32
Download citation
DOI: https://doi.org/10.1007/978-3-642-30054-7_32
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-30053-0
Online ISBN: 978-3-642-30054-7
eBook Packages: Computer ScienceComputer Science (R0)