Veracity radius: capturing the locality of distributed computations

This paper focuses on local computations of distributed aggregation problems on fixed graphs. We define a new metric on problem instances, Veracity Radius (VR), which captures the inherent possibility to compute them locally. We prove that VR yields a tight lower bound on output-stabilization time, i.e., the time until all nodes fix their outputs, as well as a lower bound on quiescence time. We present an efficient aggregation algorithm, I-LEAG, which reaches both output stabilization and quiescence within a time that is proportional to the VR of the problem instance, and is also efficient in terms of per-node communication and memory. We empirically show that the VR metric also effectively captures the performance of previously suggested efficient aggregation protocols, and that I-LEAG significantly outperforms these protocols in several respects.

[1]  Robbert van Renesse,et al.  Astrolabe: A robust and scalable technology for distributed system monitoring, management, and data mining , 2003, TOCS.

[2]  Wei Hong,et al.  Proceedings of the 5th Symposium on Operating Systems Design and Implementation Tag: a Tiny Aggregation Service for Ad-hoc Sensor Networks , 2022 .

[3]  Boaz Patt-Shamir,et al.  Time-adaptive self stabilization , 1997, PODC '97.

[4]  Ran Wolff,et al.  Association rule mining in peer-to-peer systems , 2003, IEEE Transactions on Systems, Man, and Cybernetics, Part B (Cybernetics).

[5]  Ran Wolff,et al.  A Local Algorithm for Ad Hoc Majority Voting via Charge Fusion , 2004, DISC.

[6]  Moni Naor,et al.  What can be computed locally? , 1993, STOC.

[7]  Shay Kutten,et al.  Fault-Local Distributed Mending , 1999, J. Algorithms.

[8]  David Peleg,et al.  Distributed Computing: A Locality-Sensitive Approach , 1987 .

[9]  Shay Kutten,et al.  Tight fault locality , 1995, Proceedings of IEEE 36th Annual Foundations of Computer Science.

[10]  Moni Naor,et al.  Optimal aggregation algorithms for middleware , 2001, PODS.

[11]  Deborah Estrin,et al.  Directed diffusion: a scalable and robust communication paradigm for sensor networks , 2000, MobiCom '00.

[12]  M -.  Estimating Aggregates on a Peer-to-Peer Network , 2003 .

[13]  D. Spielman,et al.  Smoothed analysis of algorithms: Why the simplex algorithm usually takes polynomial time , 2004 .

[14]  Johannes Gehrke,et al.  Gossip-based computation of aggregate information , 2003, 44th Annual IEEE Symposium on Foundations of Computer Science, 2003. Proceedings..

[15]  John Anderson,et al.  Wireless sensor networks for habitat monitoring , 2002, WSNA '02.

[16]  Shay Kutten,et al.  Fault-local distributed mending (extended abstract) , 1995, PODC '95.

[17]  Boaz Patt-Shamir,et al.  Distributed error confinement , 2003, PODC '03.

[18]  Nathan Linial,et al.  Locality in Distributed Graph Algorithms , 1992, SIAM J. Comput..

[19]  Thomas Moscibroda,et al.  What Cannot Be Computed Locally , 2004 .

[20]  Roger Wattenhofer,et al.  On the locality of bounded growth , 2005, PODC '05.

[21]  Jeffrey Considine,et al.  Approximate aggregation techniques for sensor databases , 2004, Proceedings. 20th International Conference on Data Engineering.

[22]  Deborah Estrin,et al.  Computing aggregates for monitoring wireless sensor networks , 2003, Proceedings of the First IEEE International Workshop on Sensor Network Protocols and Applications, 2003..

[23]  David R. Karger,et al.  A scalable location service for geographic ad hoc routing , 2000, MobiCom '00.