Conference proceeding
Improving Gossip Dynamics Through Overlapping Replicates
COORDINATION MODELS AND LANGUAGES, Vol.9686, pp.192-207
Lecture Notes in Computer Science
01/01/2016
DOI: 10.1007/978-3-319-39519-7_12
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.
Details
- Title: Subtitle
- Improving Gossip Dynamics Through Overlapping Replicates
- Creators
- Danilo Pianini - University of BolognaJacob Beal - RTX (United States)Mirko Viroli - University of Bologna
- Contributors
- A L Lafuente (Editor)J Proenca (Editor)
- Resource Type
- Conference proceeding
- Publication Details
- COORDINATION MODELS AND LANGUAGES, Vol.9686, pp.192-207
- Series
- Lecture Notes in Computer Science
- DOI
- 10.1007/978-3-319-39519-7_12
- ISSN
- 0302-9743
- eISSN
- 1611-3349
- Publisher
- Springer Nature
- Number of pages
- 16
- Language
- English
- Date published
- 01/01/2016
- Academic Unit
- Electrical and Computer Engineering
- Record Identifier
- 9984627285702771
Metrics
8 Record Views