Fault-Tolerant Aggregation for Dynamic Networks

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

Authors

Jesus, P (Author) Other; Baquero, C (Author) Other; Almeida, PS (Author) Other

Conference proceedings International

Title: Symposium on Reliable Distributed Systems Proceedings

Pages: 37-43

29th IEEE International Symposium on Reliable Distributed Systems

New Delhi, INDIA, OCT 31-NOV 03, 2010

Indexing

ISI Web of Knowledge - 10 Citations

Scopus - 18 Citations

Other information

Authenticus ID: P-003-D67

DOI: 10.1109/srds.2010.13

Abstract (EN): Data aggregation is a fundamental building block of modern distributed systems. Averaging based approaches, commonly designated gossip-based, are an important class of aggregation algorithms as they allow all nodes to produce a result, converge to any required accuracy, and work independently from the network topology. However, existing approaches exhibit many dependability issues when used in faulty and dynamic environments. This paper extends our own technique, Flow Updating, which is immune to message loss, to operate in dynamic networks, improving its fault tolerance characteristics. Experimental results show that the novel version of Flow Updating vastly outperforms previous averaging algorithms; it self adapts to churn without requiring any periodic restart, supporting node crashes and high levels of message loss.

Language: English

Type (Professor's evaluation): Scientific

No. of pages: 7