Skip to Main content Skip to Navigation
Conference papers

Gossip-Based Counting in Dynamic Networks

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.
Complete list of metadatas

Cited literature [12 references]  Display  Hide  Download

https://hal.inria.fr/hal-01531972
Contributor : Hal Ifip <>
Submitted on : Friday, June 2, 2017 - 11:23:30 AM
Last modification on : Saturday, November 18, 2017 - 6:16:02 PM
Long-term archiving on: : Wednesday, December 13, 2017 - 9:17:32 AM

File

978-3-642-30054-7_32_Chapter.p...
Files produced by the author(s)

Licence


Distributed under a Creative Commons Attribution 4.0 International License

Identifiers

Citation

Ruud Bovenkamp, Fernando Kuipers, Piet 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⟩

Share

Metrics

Record views

74

Files downloads

109