Improving Gossip Dynamics Through Overlapping Replicates - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Conference Papers Year : 2016

Improving Gossip Dynamics Through Overlapping Replicates

Abstract

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.
Fichier principal
Vignette du fichier
416253_1_En_12_Chapter.pdf (849.06 Ko) Télécharger le fichier
Origin : Files produced by the author(s)
Loading...

Dates and versions

hal-01631721 , version 1 (09-11-2017)

Licence

Attribution

Identifiers

Cite

Danilo Pianini, Jacob Beal, Mirko Viroli. Improving Gossip Dynamics Through Overlapping Replicates. 18th International Conference on Coordination Languages and Models (COORDINATION), Jun 2016, Heraklion, Greece. pp.192-207, ⟨10.1007/978-3-319-39519-7_12⟩. ⟨hal-01631721⟩
59 View
83 Download

Altmetric

Share

Gmail Facebook X LinkedIn More