E-cient Dynamic Aggregation

We consider the problem of dynamic aggregation of inputs over a large graph. A dynamic aggregation algorithm must continuously compute the result of a given aggregation function over a dynamically changing set of inputs. To be e‐cient, such an algorithm should refrain from sending messages when the inputs do not change, and should perform local communication whenever possible. We show an instance-based lower bound on the e‐ciency of such algorithms, and provide two algorithms matching this bound. The flrst, MultI-LEAG, re-samples the inputs at intervals that are proportional to the graph size, and is extremely message e‐cient. The second, DynI-LEAG, more closely monitors the aggregate value by sampling it more frequently, at the cost of slightly higher message complexity.

[1]  Rajeev Motwani,et al.  Estimating Aggregates on a Peer-to-Peer Network , 2003 .

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

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

[4]  A. Schuster,et al.  Association rule mining in peer-to-peer systems , 2004, IEEE Trans. Syst. Man Cybern. Part B.

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

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

[7]  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..

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

[9]  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 .

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

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

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

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

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

[15]  Rajeev Motwani,et al.  The price of validity in dynamic networks , 2004, SIGMOD '04.

[16]  Michael Elkin,et al.  A faster distributed protocol for constructing a minimum spanning tree , 2004, SODA '04.

[17]  Idit Keidar,et al.  Veracity radius: capturing the locality of distributed computations , 2006, PODC '06.