Randomized gossip algorithms

IEEE Transactions on Information Theory

Volumn 52, Issue 6, 2006, Pages 2508-2530

  Boyd, Stephen ^a   Ghosh, Arpita ^a   Prabhakar, Balaji ^a   Shah, Devavrat ^b  

^a Stanford University   (United States)

^b USA   (United States)

Author keywords

Distributed averaging; Gossip; Random walk; Scaling laws; Semidefinite programming; Sensor networks

Indexed keywords

ALGORITHMS; COMPUTER NETWORKS; EIGENVALUES AND EIGENFUNCTIONS; MATRIX ALGEBRA; OPTIMIZATION; RANDOM PROCESSES; SENSOR DATA FUSION; TOPOLOGY;

DISTRIBUTED AVERAGING; RANDOM WALK; RANDOMIZED GOSSIP ALGORITHMS; SCALING LAWS; SEMIDEFINITE PROGRAMMING; SENSOR NETWORKS;

NETWORK PROTOCOLS;

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

References (48)

1. S. Boyd, P. Diaconis, and L. Xiao, "Fastest mixing Markov chain on a graph," SIAM Rev., Problems and Techniques Section, vol. 46, no. 4, pp. 667-689, 2004.
2. S. Boyd, A. Ghosh, B. Prabhakar, and D. Shah, "Analysis and optimization of randomized gossip algorithms," in Proc. IEEE Conf. Decision and Control, Nassau, Bahamas, Dec. 2004, pp. 5310-5315.
3. S. Boyd, A. Ghosh, B. Prabhakar, and D. Shah, "Gossip algorithms: Design, analysis, and applications," in Proc. IEEE INFOCOM, Miami, FL, Mar. 2005.
4. S. Boyd, A. Ghosh, B. Prabhakar, and D. Shah, "Mixing times of random walks on geometric random graphs," in Proc. SIAM ANALCO, Vancouver, BC, Canada, Jan. 2005.
5. J. M. Borwein and A. S. Lewis, Convex Analysis and Nonlinear Optimization, Theory and Examples. New York: Springer-Verlag, 2000, Canadian Mathematical Society Books in Mathematics.
6. R. W. Beard and V. Stepanyan, "Synchronization of information in distributed multiple vehicle coordinated control," in Proc. IEEE Conf. Decision and Control, Dec. 2003, pp. 2029-2034.
7. S. Boyd and L. Vandenberghe, Convex Optimization. New York: Cambridge Univ. Press, 2004. Available [Online] at http://www.stanford.edu/~boyd/ cvxbook.html.
8. F. H. Clarke, Optimization and Nonsmooth Analysis. Philadelphia, PA: SIAM, 1990.
9. P. Diaconis and D. Stroock, "Geometric bounds for eigenvalues of Markov chains," Ann. Appl. Probab., vol. 1, no. 1, pp. 36-61, 1991.
10. A. Dembo and O. Zeitouni, Large Deviations Techniques and Applications. New York: Springer-Verlag, 1999.
11. D. Estrin, R. Govindan, J. Heidemann, and S. Kumar, "Next century challenges: Scalable coordination in sensor networks," in Proc. 5th Int. Conf. Mobile Computing and Networking, 1999, pp. 263-270.
12. L. Elsner, I. Koltracht, and M. Neumann, "On the convergence of asynchronous paracontractions with applications to tomographic reconstruction from incomplete data," Linear Algebra Appl., vol. 130, pp. 65-82, 1990.
13. P. Gupta and P. R. Kumar, "The capacity of wireless networks," IEEE Trans. Inf. Theory, vol. 46, no. 2, pp. 388-404, Mar. 2000.
14. A. El Gamal, J. Mammen, B. Prabhakar, and D. Shah, "Throughput-delay trade-off in wireless networks," in Proc. IEEE INFOCOM, 2004.
15. V. Guruswami. (2000) Rapidly Mixing Markov Chains: A Comparison of Techniques. [Online]. Available: Cs.washington.edu/homes/venkat/pubs/ papers.html
16. I. Gupta, R. van Renesse, and K. Birman, "Scalable fault-tolerant aggregation in large process groups," in Proc. Conf. Dependable Systems and Networks, 2001, pp. 442-433.
17. S. Hedetniemi, S. Hedetniemi, and A. Liestman, "A survey of gossiping and broadcasting in communication networks," Networks, vol. 18, pp. 319-349, 1988.
18. R. Horn and C. Johnson, Matrix Analysis. Cambridge, U.K.: Cambridge Univ. Press, 1985.
19. J.-B. Hiriart-Urruty and C. Lemaréchal, Convex Analysis and Minimization Algorithms. Berlin, Germany: Springer-Verlag, 1993.
20. C. Intanagonwiwat, D. Estrin, R. Govindan, and J. Heidemann, "Impact of network density on data aggregation in wireless sensor networks," in Proc. Int. Conf. Distributed Computing Systems, Jul. 2002.
21. A. Jadbabaie, J. Lin, and A. Morse, "Coordination of groups of mobile autonomous agents using nearest neighbor rules," IEEE Trans. Autom. Control, vol. 48, no. 6, pp. 988-1001, Jun. 2003.
22. D. Kempe, A. Dobra, and J. Gehrke, "Gossip-based computation of aggregate information," in Proc. Conf. Foundations of Computer Science, 2003, pp. 482-491.
23. B. Krishnamachari, D. Estrin, and S. Wicker, "The impact of data aggregation in wireless sensor networks," in Proc. Int. Workshop of Distributed Event Based Systems, Jul. 2002.
24. K. Kiwiel, "Convergence of approximate and incremental subgradient methods for convex optimization," SIAM J. Optimization, vol. 14, no. 3, pp. 807-840, 2004.
25. D. Kempe and J. Kleinberg, "Protocols and impossibility results for gossip-based communication mechanisms," in Proc. 43st IEEE Symp. Foundations of Computer Science, 2002, pp. 471-480.
26. D. Kempe, J. Kleinberg, and A. Demers, "Spatial gossip and resource location protocols," in Proc. 33rd ACM Symp. Theory of Computing, 2001, pp. 163-172.
27. J. Kleinberg, "The small-world phenomenon: An algorithmic perspective," in Proc. Symp. Theory of Computing, 2000, pp. 163-170.
28. D. Kempe and F. McSherry, "A decentralized algorithm for spectral analysis," in Proc. Symp. Theory of Computing, 2004, pp. 561-568.
29. R. Karp, C. Schindelhauer, S. Shenker, and B. Vöcking, "Randomized rumor spreading," in Proc. Symp. Foundations of Computer Science, 2000, pp. 564-574.
30. Z. Lin, M. Brouke, and B. Francis, "Local control strategies for groups of mobile autonomous agents," IEEE Trans. Autom. Control, vol. 49, no. 4, pp. 622-629, Apr. 2004.
31. A. S. Lewis, "Convex analysis on the Hermitian matrices," SIAM J. Optimization, vol. 6, pp. 164-177, 1996.
32. A. S. Lewis, "Nonsmooth analysis of eigenvalues," Math. Programming, vol. 84, pp. 1-24, 1999.
33. A. S. Lewis and M. L. Overton, "Eigenvalue optimization," Acta Numer., vol. 5, pp. 149-190, 1996.
34. S. Madden, M. Franklin, J. Hellerstein, and W. Hong, "Tag: A tiny aggregation service for ad-hoc sensor networks," ACM SIGOPS Oper. Syst. Rev., vol. 36, pp. 131-146, 2002.
35. M. Mihail, C. Papadimitriou, and A. Saberi, "On certain connectivity properties of the internet topology," in Proc. Conf. on Foundations of Computer Science, 2003, pp. 28-35.
36. L. Mureau, "Leaderless coordination via bidirectional and unidirectional time-dependent communication," in Proc. IEEE Conf. Decision and Control, Dec. 2003.
37. R. Olfati-Saber and R. M. Murray, "Consensus problems in networks of agents with switching topology and time-delays," IEEE Trans. Autom. Control, vol. 49, no. 9, pp. 1520-1533, Sep. 2004.
38. M. L. Overton, "Large-scale optimization of eigenvalues," SIAM J. Optimiz., vol. 2, pp. 88-120, 1992.
39. M. L. Overton and R. S. Womersley, "Optimality conditions and duality theory for minimizing sums of the largest eigenvalues of symmetric matrices," Math. Programming, vol. 62, pp. 321-357, 1993.
40. M. Penrose, "Random geometric graphs," in Oxford Studies in Probability. Oxford, U.K.: Oxford Univ. Press, 2003.
41. P. A. Parrilo, L. Xiao, S. Boyd, and P. Diaconis, "Symmetry analysis of reversible Markov chains," Internet Math., vol. 2, no. 1, pp. 31-71, 2003.
42. S. Ratnasamy, P. Francis, M. Handley, R. Karp, and S. Shenker, "A scalable content-addressable network," in Proc. ACM SIGCOMM Conf., 2001.
43. Y. Rabani, A. Sinclair, and R. Wanka, "Local divergence of Markov chains and the analysis of iterative load-balancing schemes," in Proc. Conf. Foundations of Computer Science, 1998, pp. 694-703.
44. 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 Conf., 2001, pp. 149-160.
45. J. Tsitsiklis, "Problems in decentralized decision making and computation," Ph.D. dissertation, Lab. Information and Decision Systems, MIT, Cambridge, MA, 1984.
46. R. van Renesse, "Scalable and secure resource location," in Proc. 33rd Hawaii Int. Conf. System Sciences, vol. 4, 2000, pp. 4012-4012.
47. H. Wolkowicz, R. Saigal, and L. Vengerghe, Eds., Handbook of Semidefinite Programming, Theory, Algorithms, and Applications. Norwell, MA: Kluwer Academic, 2000.
48. L. Xiao and S. Boyd, "Fast linear iterations for distributed averaging," in Proc. 2003 Conf. Decision and Control, Dec. 2003, pp. 4997-5002.