Gossip-based aggregate computation with low communication overhead

Networks 2006: 12th International Telecommunications Network Strategy and Planning Symposium

Volumn , Issue , 2006, Pages

  Kashyap, Srinivas ^a   Deb, Supratim ^b   Naidu, K V M ^b   Rastogi, Rajeev ^b   Srinivasan, Anand ^b  

^a UNIVERSITY OF MARYLAND   (United States)

^b LUCENT TECHNOLOGIES   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

AGGREGATES; ECONOMIC AND SOCIAL EFFECTS; INFORMATION DISSEMINATION; SENSOR NETWORKS; SENSOR NODES;

CHANNEL BANDWIDTH; COMMUNICATION OVERHEADS; GOSSIP-BASED ALGORITHMS; GOSSIP-BASED PROTOCOL; MESSAGE COMPLEXITY; NETWORK CONGESTIONS; ROUND COMPLEXITY; WIRELESS AND SENSOR NETWORKS;

COMPLEX NETWORKS;

EID: 44949253299     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/NETWKS.2006.300380     Document Type: Conference Paper

References (23)

1. M. Adler, S. Chakrabarti, M. Mitzenmacher, and L. Rasmussen. Parallel randomized load balancing. In Proc. ACM STOC, 1995.
2. B. Babcock and C. Olston. Distributed top-k monitoring. In Proc. ACM SIGMOD, 2003.
3. M. Bawa, H. Garcia-Molina, A. Gionis, and R. Motwani. Estimating aggregates on a peer-to-peer network. In Tech. report, Computer Science Dept., Stanford University, 2003.
4. S. Boyd, A. Ghosh, B. Prabhakar, and D. Shah. Gossip algorithms: Design, analysis and applications. In Proc. IEEE INFOCOM, 2005.
5. J. Chen, G. Pandurangan, and D. Xu. Robust computation of aggregates in wireless sensor networks: Distributed randomized algorithms and analysis. In Proc. IPSN, 2005.
6. G. Cormode, M. Garofalakis, S. Muthukrishnan, and R. Rastogi. Holistic aggregates in a networked world: Distributed tracking of approximate quantiles. In Proc. ACM SIGMOD, 2005.
7. A. Demers, D. Greene, C. Hauser, W. Irish, J. Larson, S. Shenker, H. Sturgis, D. Swinehart, and D. Terry. Epidemic algorithms for replicated database maintenance. In Proc. ACM PODC, 1987.
8. I. Gupta, R. van Renesse, and K. Birman. Scalable fault-tolerant aggregation in large process groups. In Proc. Conf. on Dependable Systems and Networks, 2001.
9. M. Jelasity and A. Montresor. Epidemic-style proactive aggregation in large overlay networks. In Proc. ICDCS, 2004.
10. R. Karp, C. Schindelhauer, S. Shenker, and B. Vocking. Randomized rumor spreading. In Proc. IEEE FOCS, 2000.
11. S. Kashyap, S. Deb, K. V. M. Naidu, R. Rastogi, and A. Srinivasan. Efficient Gossip-Based Agggregate Computation. In Proc. ACM PODS, 2006.
12. D. Kempe, A. Dobra, and J. Gehrke. Gossip-based computation of aggregate information. In Proc. IEEE FOCS, 2003.
13. S. Madden, M. Franklin, J. Hellerstein, and W. Hong. TAG: a tiny aggregation service for ad-hoc networks. In Proc. OSDI, 2002.
14. S. Madden, M. Franklin, J. Hellerstein, and W. Hong. The design of an acquisitional query processor for sensor networks. In Proc. ACM SIGMOD, 2003.
15. R. Motwani and P. Raghavan. Randomized Algorithms. Cambridge University Press, USA, 1995.
16. S. Nath, P. Gibbons, S. Seshan, and Z. Anderson. Synopsis diffusion for robust aggregation in sensor networks. In Proc. ACM SenSys, 2004.
17. B. Pittel. On spreading a rumor. SIAM J. Applied Math., 47(1):213-223, February 1987.
18. G. Pottie and W. Kaiser. Wireless integrated network sensors. CACM, 43:51-58, 2000.
19. A. Rowstron and P. Druschel. Pastry: Scalable, distributed object location and routing for large-scale peer-to-peer systems. In Proc. of the 18th IFIP/ACM International Conference on Distributed Systems Platforms (Middleware 2001), 2001.
20. V. Stemann. Parallel balanced allocations. In Proc. ACM SPAA, 1996.
21. I. Stoica, R. Morris, D. Karger, F. Kaashoek, and H. Balakrishnan. Chord: A scalable peer-to-peer lookup service for internet applications. In Proc. ACM SIGCOMM, 2001.
22. R. van Renesse, K. Birman, and W. Vogels. Astrolabe: A robust and scalable technology for distributed system monitoring, management, and data mining. ACM TOCS, 2003.
23. Y. Yao and J. Gehrke. Query processing in sensor networks. In Proc. CIDR, 2003.