Computing separable functions via gossip

Proceedings of the Annual ACM Symposium on Principles of Distributed Computing

Volumn 2006, Issue , 2006, Pages 113-122

  Mosk Aoyama, Damon ^a   Shah, Devavrat ^b  

^a Stanford University   (United States)

^b MASSACHUSETTS INSTITUTE OF TECHNOLOGY   (United States)

Author keywords

Data aggregation; Gossip; Randomized algorithms

Indexed keywords

ALGORITHMS; DISTRIBUTED COMPUTER SYSTEMS; FUNCTIONS; ITERATIVE METHODS; LINEAR PROGRAMMING; MOBILE COMPUTING; PROBLEM SOLVING;

DATA AGGREGATION; GOSSIP; ITERATIVE ALGORITHMS; RANDOMIZED ALGORITHMS;

COMPUTER NETWORKS;

EID: 33748699331     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1146381.1146401     Document Type: Conference Paper

References (23)

1. M. C. Azizoǧlu and Ö. Eǧecioǧlu. The isoperimetric number of d-dimensional k-ary arrays. International Journal of Foundations of Computer Science, 10(3):289-300, 1999.
2. Z. Bar-Yossef, T. Jayram, R. Kumar, D. Sivakumar, and L. Trevisan. Counting distinct elements in a data stream. In Proceedings of RANDOM 2002, pages 1-10, 2002.
3. N. Berger, C. Borgs, J. T. Chayes, and A. Saberi. On the spread of viruses on the internet. In Proceedings of the Sixteenth Annual ACM-SIAM Symposium on Discrete Algorithms, pages 301-310, 2005.
4. D. P. Bertsekas and J. N. Tsitsiklis. Parallel and Distributed Computation: Numerical Methods. Prentice Hall, 1989.
5. S. Boyd, A. Ghosh, B. Prabhakar, and D. Shah. Gossip algorithms: Design, analysis and applications. In Proceedings of IEEE INFOCOM 2005, pages 1653-1664, 2005.
6. J. Considine, F. Li, G. Kollios, and J. Byers. Approximate aggregation techniques for sensor databases. In Proceedings of the 20th International Conference on Data Engineering, pages 449-460, 2004.
7. A. Dembo and O. Zeitouni. Large Deviations Techniques and Applications. Springer, second edition, 1998.
8. 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 Proceedings of the Sixth Annual ACM Symposium on Principles of Distributed Computing, pages 1-12, 1987.
9. P. Flajolet and G. N. Martin. Probabilistic counting algorithms for data base applications. Journal of Computer and System Sciences, 31(2):182-209, 1985.
10. A. M. Frieze and G. R. Grimmett. The shortest-path problem for graphs with random arc-lengths. Discrete Applied Mathematics, 10:57-77, 1985.
11. A. Ganesh, L. Massoulié, and D. Towsley. The effect of network topology on the spread of epidemics. In Proceedings of IEEE INFOCOM 2005, pages 1455-1466, 2005.
12. D. Kempe, A. Dobra, and J. Gehrke. Gossip-based computation of aggregate information. In Proceedings of the 44th Annual IEEE Symposium on Foundations of Computer Science, pages 482-491, 2003.
13. D. Kempe and J. Kleinberg. Protocols and impossibility results for gossip-based communication mechanisms. In Proceedings of the 43rd Annual IEEE Symposium on Foundations of Computer Science, pages 471-480, 2002.
14. D. Kempe, J. Kleinberg, and A. Demers. Spatial gossip and resource location protocols. In Proceedings of the 33rd Annual ACM Symposium on Theory of Computing, pages 163-172, 2001.
15. D. Kempe and F. McSherry. A decentralized algorithm for spectral analaysis. In Proceedings of the 36th Annual ACM Symposium on Theory of Computing, pages 561-568, 2004.
16. E. Modiano, D. Shah, and G. Zussman. Maximizing throughput in wireless networks via gossip. Submitted, 2005.
17. S. Nath, P. B. Gibbons, S. Seshan, and Z. R. Anderson. Synopsis diffusion for robust aggregation in sensor networks. In Proceedings of the 2nd International Conference on Embedded Networked Sensor Systems, pages 250-262, 2004.
18. B. Pittel. On spreading a rumor. SIAM Journal of Applied Mathematics, 47(1):213-223, 1987.
19. R. Ravi. Rapid rumor ramification: Approximating the minimum broadcast time. In Proceedings of the 35th Annual IEEE Symposium on Foundations of Computer Science, pages 202-213, 1994.
20. O. Reingold, S. Vadhan, and A. Wigderson. Entropy waves, the zig-zag graph product, and new constant-degree expanders and extractors. In Proceedings of the 41st Annual IEEE Symposium on Foundations of Computer Science, pages 3-13, 2000.
21. A. Sinclair. Algorithms for Random Generation and Counting: A Markov Chain Approach. Birkhäuser, Boston, 1993.
22. J. N. Tsitsiklis. Problems in Decentralized Decision Making and Computation. PhD thesis, Department of Electrical Engineering and Computer Science, Massachusetts Institute of Technology, 1984.
23. J. N. Tsitsiklis, D. P. Bertsekas, and M. Athans. Distributed asynchronous deterministic and stochastic gradient optimization algorithms. IEEE Transactions on Automatic Control, 31(9):803-812, 1986.