Skip to Main content Skip to Navigation
Conference papers

Spectra: Robust Estimation of Distribution Functions in Networks

Abstract : The distributed aggregation of simple aggregates such as minima/maxima, counts, sums and averages have been studied in the past and are important tools for distributed algorithms and network coordination. Nonetheless, this kind of aggregates may not be comprehensive enough to characterize biased data distributions or when in presence of outliers, making the case for richer estimates.This work presents Spectra, a distributed algorithm for the estimation of distribution functions over large scale networks. The estimate is available at all nodes and the technique depicts important properties: robustness when exposed to high levels of message loss, fast convergence speed and fine precision in the estimate. It can also dynamically cope with changes of the sampled local property and with churn, without requiring restarts. The proposed approach is experimentally evaluated and contrasted to a competing state of the art distribution aggregation technique.
Complete list of metadata

Cited literature [11 references]  Display  Hide  Download
Contributor : Hal Ifip <>
Submitted on : Wednesday, May 24, 2017 - 5:22:54 PM
Last modification on : Wednesday, May 24, 2017 - 5:24:56 PM
Long-term archiving on: : Monday, August 28, 2017 - 5:41:12 PM


Files produced by the author(s)


Distributed under a Creative Commons Attribution 4.0 International License



Miguel Borges, Paulo Jesus, Carlos Baquero, Paulo Almeida. Spectra: Robust Estimation of Distribution Functions in Networks. 12th International Conference on Distributed Applications and Interoperable Systems (DAIS), Jun 2012, Stockholm, Sweden. pp.96-103, ⟨10.1007/978-3-642-30823-9_8⟩. ⟨hal-01527636⟩



Record views


Files downloads