Gossip-Based Counting in Dynamic Networks - NETWORKING 2012 Access content directly
Conference Papers Year : 2012

Gossip-Based Counting in Dynamic Networks


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.
Fichier principal
Vignette du fichier
978-3-642-30054-7_32_Chapter.pdf (576.18 Ko) Télécharger le fichier
Origin : Files produced by the author(s)

Dates and versions

hal-01531972 , version 1 (02-06-2017)





Ruud van De Bovenkamp, Fernando Kuipers, Piet Van Mieghem. Gossip-Based Counting in Dynamic Networks. 11th International Networking Conference (NETWORKING), May 2012, Prague, Czech Republic. pp.404-417, ⟨10.1007/978-3-642-30054-7_32⟩. ⟨hal-01531972⟩
57 View
70 Download



Gmail Facebook X LinkedIn More