A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2011; you can also visit the original URL.
The file type is application/pdf
.
Fault-Tolerant Aggregation for Dynamic Networks
2010
2010 29th IEEE Symposium on Reliable Distributed Systems
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
doi:10.1109/srds.2010.13
dblp:conf/srds/JesusBA10
fatcat:x3blsbzdpje5fj2ta2xgrgsqfq