%0 Conference Proceedings
%T Gossip-Based Counting in Dynamic Networks
%+ Network Architectures and Services Group (NAS GROUP)
%A Bovenkamp, Ruud, van De
%A Kuipers, Fernando
%A Mieghem, Piet, Van
%Z Part 8: Wireless Networks II
%< avec comité de lecture
%( Lecture Notes in Computer Science
%B 11th International Networking Conference (NETWORKING)
%C Prague, Czech Republic
%Y Robert Bestak
%Y Lukas Kencl
%Y Li Erran Li
%Y Joerg Widmer
%Y Hao Yin
%I Springer
%3 NETWORKING 2012
%V LNCS-7290
%N Part II
%P 404-417
%8 2012-05-21
%D 2012
%R 10.1007/978-3-642-30054-7_32
%K Gossip-algorithms
%K network dynamics
%K node counting
%Z Computer Science [cs]
%Z Computer Science [cs]/Networking and Internet Architecture [cs.NI]Conference papers
%X 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.
%G English
%Z TC 6
%2 https://inria.hal.science/hal-01531972/document
%2 https://inria.hal.science/hal-01531972/file/978-3-642-30054-7_32_Chapter.pdf
%L hal-01531972
%U https://inria.hal.science/hal-01531972
%~ IFIP-LNCS
%~ IFIP
%~ IFIP-TC
%~ IFIP-TC6
%~ IFIP-LNCS-7290
%~ IFIP-NETWORKING