Gossip algorithms: Design, analysis and applications

Proceedings - IEEE INFOCOM

Volumn 3, Issue , 2005, Pages 1653-1664

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

^a Stanford University ^*  (United States)

Author keywords

[No Author keywords available]

Indexed keywords

AD HOC NETWORKS; ASYNCHRONOUS ALGORITHMS; INFORMATION EXCHANGE; RANDOM WALK;

ALGORITHMS; GRAPH THEORY; MATHEMATICAL MODELS; PROBABILITY; PROBLEM SOLVING; RANDOM PROCESSES;

WIRELESS TELECOMMUNICATION SYSTEMS;

EID: 25844517631     PISSN: 0743166X     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/INFCOM.2005.1498447     Document Type: Conference Paper

References (41)

1. [BDX03] S. Boyd, P. Diaconis, and L. Xiao. Fastest mixing Markov chain on a graph. Submitted to SIAM Review, problems and techniques section, February 2003. Available at www.stanford.edu/~boyd/fmmc.html.
2. [BGPS04] S. Boyd, A. Ghosh, B. Prabhakar, and D. Shah. Analysis and optimization of randomized gossip algorithms. In Proc. 2004 IEEE CDC, 2004.
3. [BGPS05] S. Boyd, A. Ghosh, B. Prabhakar, and D. Shah. Mixing times of random walks on geometric random graphs. Proc. SIAM ANALCO, 2005.
4. [BL00] J. M. Borwein and A. S. Lewis. Convex Analysis and Nonlinear Optimization, Theory and Examples. Canadian Mathematical Society Books in Mathematics. Springer-Verlag, New York, 2000.
5. [BS03] R. W. Beard and V. Stepanyan. Synchronization of information in distributed multiple vehicle coordinated control. In Proceedings of IEEE Conference on Decision and Control, December 2003.
6. [BV03] S. Boyd and L. Vandenberghe. Convex Optimization. Cambridge University Press, 2003. Available at http://www.stanford.edu/~boyd/cvxbook.
7. [Cla90] F. H. Clarke. Optimization and Nonsmooth Analysis. SIAM, Philadelphia, 1990.
8. [DZ99] A. Dembo and O. Zeitouni. Large Deviations Techniques and Applications. Springer, 1999.
9. [EGHK99] D. Estrin, R. Govindan, J. Heidemann, and S. Kumar. Next century challenges: Scalable coordination in sensor networks. In Proc. 5th Intl. Conf. on Mobile Computing and Networking, 1999.
10. [GK00] P. Gupta and P. R. Kumar. The capacity of wireless networks. IEEE Transactions on Information Theory, 46(2):388-404, March 2000.
11. [GMPS04] A. El Gamal, J. Mammen, B. Prabhakar, and D. Shah. Throughput-delay trade-off in wireless networks. In Proc. 2004 INFOCOM, 2004.
12. [GvRB01] 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.
13. [HHL88] S. Hedetniemi, S. Hedetniemi, and A. Liestman. A survey of gossiping and broadcasting in communication networks. Networks, 18:319-349, 1988.
14. [HUL93] J.-B. Hiriart-Urruty and C. Lemaréchal. Convex Analysis and Minimization Algorithms. Springer-Verlag, Berlin, 1993.
15. [IEGH02] C. Intanagonwiwat, D. Estrin, R. Govindan, and J. Heidemann. Impact of netowrk density on data aggregation in wireless sensor networks. In Proc. Intl. Conf. on Distributed Computing Systems, 2002.
16. [JLS03] A. Jadbabaie, J. Lin, and A. S.Morse. Coordination of groups of mobile autonomous agents using nearest neighbor rules. IEEE Transactions on Automatic Control, 48(6):988-1001, June 2003.
17. [KDG03] D. Kempe, A. Dobra, and J. Gehrke. Gossip-based computation of aggregate information. In Proc. Conference on Foundations of Computer Science. IEEE, 2003.
18. [KEW02] B. Krishnamachari, D. Estrin, and S. Wicker. The impact of data aggregation in wireless sensor networks. In Intl. Workshop of Distributed Event Based Systems, 2002.
19. [Kiw04] K. Kiwiel. Convergence of approximate and incremental subgradient methods for convex optimization. SIAM Journal on Optimization, 14(3):807-840, 2004.
20. [KK02] D. Kempe and J. Kleinberg. Protocols and impossibility results for gossip-based communication mechanisms. In Proc. 43st IEEE Symp. on Foundations of Computer Science, 2002.
21. [KKD01] D. Kempe, J. Kleinberg, and A. Demers. Spatial gossip and resource location protocols. In Proc. 33rd ACM Symp. on Theory of Computing, 2001.
22. [KM04] D. Kempe and Frank McSherry. A decentralized algorithm for spectral analaysis. In Symposium on Theory of Computing. ACM, 2004.
23. [KSSV00a] R. Karp, C. Schindelhauer, S. Shenker, and B. Vocking. Randomized rumor spreading. In Proc. 41st IEEE Symp. on Foundations of Computer Science, 2000.
24. [KSSV00b] R. Karp, C. Schindelhauer, S. Shenker, and B. Vcking. Randomized rumor spreading. In Proc. Symposium on Foundations of Computer Science. IEEE, 2000.
25. [LBF04] Z. Lin, M. Brouke, and B. Francis. Local control strategies for groups of mobile autonomous agents. 49(4):622-629. April 2004.
26. [Lew96] A. S. Lewis. Convex analysis on the Hemitian matrices. SIAM Journal on Optimization, 6:164-177, 1996.
27. [Lew99] A. S. Lewis. Nonsmooth analysis of eigenvalues. Mathematical Programming, 84:1-24, 1999.
28. [LO96] A. S. Lewis and M. L. Overton. Eigenvalue optimization. Acta Numerica, 5:149-190, 1996.
29. [MFHH02] S. Madden, M. Franklin, J. Hellerstein, and W. Hong. Tag: A tiny aggregation service for ad-hoc sensor networks. In Proc. 5th Symp.on Operating Systems Design and Implementation, 2002.
30. [MPS03] M. Mihail, C. Papadimitriou, and A. Saberi. Internet is an exapnder. In Proc. Conf. on Foundations of Computer Science, 2003.
31. [Mur03] L. Mureau. Leaderless coordination via bidirectional and unidirectional time-dependent communication. In Proceedings of IEEE Conference on Decision and Control, December 2003.
32. [OSM04] R. Olfati-Saber and R. M. Murray. Consensus problems in networks of agents with switching topology and time-delays. IEEE Transactions on Automatic Control, 49(9):1520-1533, September 2004.
33. [Ove92] M. L. Overton. Large-scale optimization of eigenvalues. SIAM Journal on Optimization, 2:88-120, 1992.
34. [OW93] M. L. Overton and R. S. Womersley. Optimality conditions and duality theory for minimizing sums of the largest eigenvalues of symmetric matrices. Mathematical Programming, 62:321-357, 1993.
35. [Pen03] M. Penrose. Random geometric graphs. Oxford studies in probability. Oxford University Press, Oxford, 2003.
36. +01] S. Ratnasamy, P. Francis, M. Handley, R. Karp, and S. Shenker. A scalable content-addressable network. In Proc.of the ACM SIGCOMM Conference, 2001.
37. [RSW98] Y. Rabani, A. Sinclair, and R. Wanka. Local divergence of Markov chains and the analysis of iterative load-balancing schemes. In Proc. Conference on Foundations of Computer Science. IEEE, 1998.
38. +01] I. Stoica, R. Morris, D. Karger, F. Kaashoek, and H. Balakrishnan. Chord: A scalable peer-to-peer lookup service for internet applications. In Proc.of the ACM SIGCOMM Conference, 2001.
39. [vR00] R. van Renesse. Scalable and secure resource location. In 33rd Hawaii Intl. Conf. on System Sciences, 2000.
40. [WSV00] H. Wolkowicz, R. Saigal, and L. Vandenberghe. Handbook of Semidefinite Programming, Theory, Algorithms, and Applications. Kluwer Academic Publishers, 2000.
41. [XB03] L. Xiao and S. Boyd. Fast linear iterations for distributed averaging. In Proc. 2003 Conference on Decision and Control, December 2003.