%0 Conference Proceedings
%T Improving Gossip Dynamics Through Overlapping Replicates
%+ Alma Mater Studiorum Università di Bologna = University of Bologna (UNIBO)
%+ Raytheon BBN Technologies
%A Pianini, Danilo
%A Beal, Jacob
%A Viroli, Mirko
%< avec comité de lecture
%( Lecture Notes in Computer Science
%B 18th International Conference on Coordination Languages and Models (COORDINATION)
%C Heraklion, Greece
%Y Alberto Lluch Lafuente
%Y José Proença
%I Springer International Publishing
%3 Coordination Models and Languages
%V LNCS-9686
%P 192-207
%8 2016-06-06
%D 2016
%R 10.1007/978-3-319-39519-7_12
%Z Computer Science [cs]
%Z Computer Science [cs]/Networking and Internet Architecture [cs.NI]Conference papers
%X Gossip protocols are a fast and effective strategy for computing a wide class of aggregate functions involving coordination of large sets of nodes. The monotonic nature of gossip protocols, however, mean that they can typically only adjust their estimate in one direction unless restarted, which disrupts the values being returned. We propose to improve the dynamical performance of gossip by running multiple replicates of a gossip algorithm, overlapping in time. We find that this approach can significantly reduce the error of aggregate function estimates compared to both typical gossip implementations and tree-based estimation functions.
%G English
%Z TC 6
%Z WG 6.1
%2 https://inria.hal.science/hal-01631721/document
%2 https://inria.hal.science/hal-01631721/file/416253_1_En_12_Chapter.pdf
%L hal-01631721
%U https://inria.hal.science/hal-01631721
%~ IFIP-LNCS
%~ IFIP
%~ IFIP-TC
%~ IFIP-WG
%~ IFIP-TC6
%~ IFIP-WG6-1
%~ IFIP-COORDINATION
%~ IFIP-LNCS-9686