Fast distributed algorithms for computing separable functions

IEEE Transactions on Information Theory

Volumn 54, Issue 7, 2008, Pages 2997-3007

  Mosk Aoyama, Damon ^a   Shah, Devavrat ^b  

^a Stanford University   (United States)

^b USA   (United States)

Author keywords

Data aggregation; Distributed algorithms; Gossip algorithms; Randomized algorithms

Indexed keywords

AD HOC NETWORKS; ALGORITHMS; BOOLEAN FUNCTIONS; GRAPH THEORY; ITERATIVE METHODS; PARALLEL ALGORITHMS; SENSOR NETWORKS; WIRELESS TELECOMMUNICATION SYSTEMS;

(MIN ,MAX ,+) FUNCTIONS; COMPUTATION ALGORITHMS; COMPUTING FUNCTIONS; DISTRIBUTED ALGORITHMS; GENERAL (CO); GRID GRAPHS; HOC NETWORKS; INDIVIDUAL (PSS 544-7); ITERATIVE ALGORITHMS; LINEAR COMBINATION (LC); LOCAL INFORMATION; NORMALIZED VALUES; OF GRAPHS; PEER-TO-PEER (P2P); RANDOMIZED ALGORITHMS; RUNNING TIME; SPECTRAL GAPS;

FUNCTION EVALUATION;

EID: 46749116895     PISSN: 00189448     EISSN: None     Source Type: Journal    
DOI: 10.1109/TIT.2008.924648     Document Type: Article

References (26)

1. S. Nath, P. B. Gibbons, S. Seshan, and Z. R. Anderson, "Synopsis diffusion for robust aggregation in sensor networks," in Proc. 2nd Int. Conf. Embedded Netw. Sensor Syst., 2004, pp. 250-262.
2. S. Boyd, A. Ghosh, B. Prabhakar, and D. Shah, "Gossip algorithms: Design, analysis and applications," in Proc. IEEE INFOCOM, 2005, pp. 1653-1664.
3. P. Flajolet and G. N. Martin, "Probabilistic counting algorithms for data base applications," J. Comput. Syst. Sci., vol. 31, no. 2, pp. 182-209, 1985.
4. Z. Bar-Yossef, T. Jayram, R. Kumar, D. Sivakumar, and L. Trevisan, "Counting distinct elements in a data stream," in Proc. RANDOM, 2002, pp. 1-10.
5. J. Considine, F. Li, G. Kollios, and J. Byers, "Approximate aggregation techniques for sensor databases," in Proc. 20th Int. Conf. Data Eng. 2004, pp. 449-460.
6. J. N. Tsitsiklis, "Problems in decentralized decision making and computation," Ph.D. dissertation, Dept. Electr. Eng. Comput. Sci., Massachusetts Inst. Technol., Cambridge, MA, 1984.
7. J. N. Tsitsiklis, D. P. Bertsekas, and M. Athans, "Distributed asynchronous deterministic and stochastic gradient optimization algorithms," IEEE Trans. Autom. Control, vol. 31, no. 9, pp. 803-812, Sep. 1986.
8. D. P. Bertsekas and J. N. Tsitsiklis, Parallel and Distributed Computation: Numerical Methods. Englewood Cliffs, NJ: Prentice-Hall, 1989.
9. D. Kempe, A. Dobra, and J. Gehrke, "Gossip-based computation of aggregate information," in Proc. 44th Annu. IEEE Symp. Foundations Comput. Sci., 2003, pp. 482-491.
10. A. M. Frieze and G. R. Grimmett, "The shortest-path problem for graphs with random arc-lengths," Discrete Appl. Math., vol. 10, pp. 57-77, 1985.
11. B. Pittel, "On spreading a rumor," SIAM J. Appl. Math., vol. 47, no. 1, pp. 213-223, 1987.
12. 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. 6th Annu. ACM Symp. Principles Distributed Comput., 1987, pp. 1-12.
13. R. Karp, C. Schindelhauer, S. Shenker, and B. Vöcking, "Randomized rumor spreading," in Proc. 41st Annu. IEEE Symp. Foundations Comput. Sci., 2000, pp. 565-574.
14. R. Ravi, "Rapid rumor ramification: Approximating the minimum broadcast time," in Proc. 35th Annu. IEEE Symp. Foundations Comput. Sci., 1994, pp. 202-213.
15. D. Kempe and J. Kleinberg, "Protocols and impossibility results for gossip-based communication mechanisms," in Proc. 43rd Annu. IEEE Symp. Foundations Comput. Sci., 2002, pp. 471-480.
16. D. Kempe, J. Kleinberg, and A. Demers, "Spatial gossip and resource location protocols," in Proc. 33rd Annu. ACM Symp. Theory Comput. 2001, pp. 163-172.
17. A. Ganesh, L. Massoulié, and D. Towsley, "The effect of network topology on the spread of epidemics," in Proc. IEEE INFOCOM, 2005, pp. 1455-1466.
18. N. Berger, C. Borgs, J. T. Chayes, and A. Saberi, "On the spread of viruses on the internet," in Proc. 16th Annu. ACM-SIAM Symp. Discrete Algorithms, 2005, pp. 301-310.
19. D. Kempe and F. McSherry, "A decentralized algorithm for spectral analysis," in Proc. 36th Annu. ACM Symp. Theory Comput., 2004, pp. 561-568.
20. E. Modiano, D. Shah, and G. Zussman, "Maximizing throughput in wireless networks via gossiping," in Proc. Joint Int. Conf. Meas. Modeling Comput. Syst., 2006, pp. 27-38.
21. A. Dembo and O. Zeitouni, Large Deviations Techniques and Applications, 2nd ed. New York: Springer-Verlag, 1998.
22. E. Cohen, "Size-estimation framework with applications to transitive closure and reachability," J. Comput. Syst. Sci., vol. 55, no. 3, pp. 441-453, 1997.
23. A. Sinclair, Algorithms for Random Generation and Counting: A Markov Chain Approach. Boston, MA: Birkhäuser, 1993.
24. O. Reingold, S. Vadhan, and A. Wigderson, "Entropy waves, the zig-zag graph product, and new constant-degree expanders and extractors," in Proc. 41st Annu. IEEE Symp. Foundations Comput. Sci., 2000, pp. 3-13.
25. M. C. Azizoǧlu and Ö. Eǧecioǧlu, "The isoperimetric number of d-dimensional k-ary arrays," Int. J. Foundations Comput. Sci., vol 10, no. 3, pp. 289-300, 1999.
26. M. Enachescu., A. Goel, R. Govindan, and R. Motwani, "Scale free aggregation in sensor networks," in Int. Workshop Algorithmic Aspects Wireless Sensor Netw., 2004, pp. 71-84.