Fault-Tolerant aggregation: flow-updating meets mass-distribution
OPODIS'11 Proceedings of the 15th international conference on Principles of Distributed Systems
LiMoSense --- live monitoring in dynamic sensor networks
ALGOSENSORS'11 Proceedings of the 7th international conference on Algorithms for Sensor Systems, Wireless Ad Hoc Networks and Autonomous Mobile Entities
Spectra: robust estimation of distribution functions in networks
DAIS'12 Proceedings of the 12th IFIP WG 6.1 international conference on Distributed Applications and Interoperable Systems
A hierarchical back-end architecture for smartphone sensing
Proceedings of the 2012 ACM Research in Applied Computation Symposium
| Hi-index | 0.00 |
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.