Fault-Tolerant Aggregation: Flow-Updating Meets Mass-Distribution

• Type: Article in International Conference Proceedings Book
• Date: 2011

Authors

Almeida, PS (Author) Other; Baquero, C (Author) Other; Farach Colton, M (Author) Other; Jesus, P (Author) Other; Mosteiro, MA (Author) Other

Conference proceedings International

Title: PRINCIPLES OF DISTRIBUTED SYSTEMS

Pages: 513-527

15th International Conference on Principles of Distributed Systems (OPODIS 2011)

Toulouse, FRANCE, DEC 13-16, 2011

Indexing

ISI Web of Knowledge - 5 Citations

Scopus - 8 Citations

Other information

Authenticus ID: P-002-WBJ

DOI: 10.1007/978-3-642-25873-2_35

Abstract (EN): Flow-Updating (FU) is a fault-tolerant technique that has proved to be efficient in practice for the distributed computation of aggregate functions in communication networks where individual processors do not have access to global information. Previous distributed aggregation protocols, based on repeated sharing of input values (or mass) among processors, sometimes called Mass-Distribution (MD) protocols, are not resilient to communication failures (or message loss) because such failures yield a loss of mass. In this paper, we present a protocol which we call Mass-Distribution with Flow-Updating (MDFU). We obtain MDFU by applying FU techniques to classic MD. We analyze the convergence time of MDFU showing that stochastic message loss produces low overhead. This is the first convergence proof of an FU-based algorithm. We evaluate MDFU experimentally, comparing it with previous MD and FU protocols, and verifying the behavior predicted by the analysis. Finally, given that MDFU incurs a fixed deviation proportional to the message-loss rate, we adjust the accuracy of MDFU heuristically in a new protocol called MDFU with Linear Prediction (MDFU-LP). The evaluation shows that both MDFU and MDFU-LP behave very well in practice, even under high rates of message loss and even changing the input values dynamically.

Language: English

Type (Professor's evaluation): Scientific

No. of pages: 15