Gossip algorithms

Foundations and Trends in Networking

Volumn 3, Issue 1, 2008, Pages 1-125

  Shah, Devavrat ^a  

^a MASSACHUSETTS INSTITUTE OF TECHNOLOGY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ARCHITECTURAL SOLUTIONS; ESTIMATION ALGORITHM; GOSSIP ALGORITHMS; INFORMATION EXCHANGE PROTOCOL; MARKOV CHAIN THEORY; MOBILE NETWORKS; NETWORK ALGORITHMS; NEXT GENERATION NETWORK; PEER-TO-PEER NETWORKS; RANDOM GRAPHS; RECENT PROGRESS; RESOURCE CONSTRAINT; RESOURCE UTILIZATIONS; SOCIAL NETWORKS; SPECTRAL GRAPH THEORY; TELEPHONE NETWORKS;

ALGORITHMS; BROADCASTING; DISTRIBUTED COMPUTER SYSTEMS; GRAPH THEORY; INTERNET; INTERNET PROTOCOLS; MARKOV PROCESSES; SOLVENTS; TELEPHONE; TELEPHONE CIRCUITS; WIRELESS NETWORKS;

SENSOR NETWORKS;

EID: 68349152988     PISSN: 1554057X     EISSN: 15540588     Source Type: Journal    
DOI: 10.1561/1300000014     Document Type: Article

References (70)

1. D. J. Aldous, "Some inequalities for reversible Markov chains," Journal of the London Mathematical Society, vol. 25, pp. 564-576, 1982.
2. n," Bulletin de la Société Mathématique de France, vol. 111, no. 4, pp. 429-448, 1983.
3. O. Ayaso, "Information theoretic approaches to distributed function computation," PhD thesis, Massachusetts Institute of Technology, 2008.
4. Y. Bartal, J. W. Byers, and D. Raz, "Fast, distributed approximation algorithms for positive linear programming with applications to flow control," SIAM Journal on Computing, vol. 33, no. 6, pp. 1261-1279, 2004.
5. D. P. Bertsekas and J. N. Tsitsiklis, Parallel and Distributed Computation: Numerical Methods. Prentice Hall, 1989.
6. V. D. Blondel, J. M. Hendrickx, A. Olshevsky, and J. N. Tsitsiklis, "Convergence in multiagent coordination, consensus, and flocking," in Joint 44th IEEE Conference on Decision and Control and European Control Conference (CDCECC'05), December 2005.
7. S. Boyd, P. Diaconis, and L. Xiao, "Fastest mixing Markov chain on a graph," SIAM Review, 2004.
8. S. Boyd, A. Ghosh, B. Prabhakar, and D. Shah, "Randomized gossip algorithms," IEEE/ACM Transaction on Networking, vol. 14, no. SI, pp. 2508-2530, 2006.
9. S. Boyd and L. Vandenberghe, Convex Optimization. Cambridge University Press, 2004.
10. P. Chaporkar, K. Kar, and S. Sarkar, "Throughput guarantees through maximal scheduling in wireless networks," in 43rd Allerton Conference on Communication Control and Computing, 2005.
11. L. Chen, S. H. Low, M. Chang, and J. C. Doyle, "Optimal cross-layer congestion control, routing and scheduling design in ad-hoc wireless networks," in IEEE INFOCOM, 2006.
12. J. Considine, F. Li, G. Kollios, and J. W. Byers, "Approximate aggregation techniques for sensor databases," in 20th IEEE International Conference on Data Engineering, April 2004.
13. J. Dai and B. Prabhakar, "The throughput of switches with and without speedup," in Proceedings of IEEE Infocom, pp. 556-564, 2000.
14. S. Deb, M. Médard, and C. Choute, "Algebraic gossip: A network coding approach to optimal multiple rumor mongering," IEEE/ACM Transactions on Networking, vol. 14, 2006.
15. A. Dembo and O. Zeitouni, Large Deviations Techniques and Applications. Springer, Second Edition, 1998.
16. P. Diaconis, S. Holmes, and R. Neal, "Analysis of a non-reversible Markov chain sampler," Annals of Applied Probability, vol. 10, pp. 726-752, 2000.
17. P. Diaconis and L. Saloff-Coste, "Moderate growth and random walk on finite groups," Geometric and Functional Analysis, vol. 4, no. 1, pp. 1-36, 1994.
18. A. G. Dimakis, A. D. Sarwate, and M. J. Wainwright, "Geographic gossip: Efficient aggregation for sensor networks," in 5th International ACM/IEEE Symposium on Information Processing in Sensor Networks (IPSN'06), April 2006.
19. A. El Gamal, J. Mammen, B. Prabhakar, and D. Shah, "Optimal throughputdelay scaling in wireless networks-part I: The fluid model," IEEE Transactions on Information Theory, vol. 52, no. 6, pp. 2568-2592, 2006.
20. L. Elsner, I. Koltracht, and M. Neumann, "On the convergence of asynchronous paracontractions with applications to tomographic reconstruction from incomplete data," Linear Algebra and Its Applications, no. 130, pp. 65-82, 1990.
21. M. Enachescu, A. Goel, R. Govindan, and R. Motwani, "Scale free aggregation in sensor networks," in International Workshop on Algorithmic Aspects of Wireless Sensor Networks, 2004.
22. A. Eryilmaz, A. Ozdaglar, D. Shah, and E. Modiano, "Distributed cross-layer algorithms for the optimal control of multi-hop wireless networks," IEEE/ACM Transactions on Networking (accepted to appear), 2009.
23. P. Flajolet and G. N. Martin, "Probabilistic counting algorithms for data base applications," Journal of Computer and System Science, vol. 31, no. 2, pp. 182-209, 1985.
24. R. G. Gallager, "A minimum delay routing algorithm using distributed computation," IEEE Transactions on Communications, vol. COM-25, no. l, pp. 73-85, 1977.
25. M. R. Garey and D. S. Johnson, Computers and Intractability: A Guide to the Theory of NP-Completeness.
26. N. Garg and N. E. Young, "On-line end-to-end congestion control," in IEEE FOCS, pp. 303-312, 2002.
27. P. Giaccone, B. Prabhakar, and D. Shah, "Randomized scheduling algorithms for high-aggregate bandwidth switches," IEEE Journal of Select Areas Communication High-performance Electronic Switches/Routers for High-speed Internet, vol. 21, no. 4, pp. 546-559, 2003.
28. P. Gupta and P. R. Kumar, "The capacity of wireless networks," IEEE Transaction on Information Theory, vol. 46, no. 2, pp. 388-404, March 2000.
29. B. Hajek and G. Sasaki, "Link scheduling in polynomial time," IEEE Transactions on Information Theory, vol. 34, 1988.
30. R. Horn and C. Johnson, Matrix Analysis. Cambridge, UK: Cambridge University Press, 1985.
31. http://www.reuters.com/article/pressrelease/idUS55597+16-Jan-2008+BW 20080116.
32. A. Jadbabaie, J. Lin, and A. Morse, "Coordination of groups of mobile autonomous agents using nearest neighbor rules," IEEE Transactions on Automatic Control, vol. 48, no. 6, pp. 988-1001, 2003.
33. K. Jung and D. Shah, "Low delay scheduling in wireless network," in IEEE ISIT, 2007.
34. K. Jung, D. Shah, and J. Shin, "Minimizing rate of convergence for iterative algorithms," IEEE Transactions on Information Theory (accepted to appear), 2009.
35. A. Kashyap, T. Basar, and R. Srikant, "Quantized consensus," (in press).
36. F. P. Kelly, A. K. Maulloo, and D. K. H. Tan, "Rate control for communication networks: Shadow prices, proportional fairness and stability," Journal of the Operational Research Society, vol. 49, no. 3, pp. 237-252, March 1998.
37. D. Kempe, A. Dobra, and J. Gehrke, "Gossip-based computation of aggregate information," in FOCS'03: Proceedings of the 44th Annual IEEE Symposium on Foundations of Computer Science, p. 482, Washington, DC, USA: IEEE Computer Society, 2003.
38. D. Kempe and F. McSherry, "A decentralized algorithm for spectral analaysis," in Symposium on Theory of Computing, ACM, 2004.
39. M. Koubarakis, C. Tryfonopoulos, S. Idreos, and Y. Drougas, "Selective information dissemination in P2P networks: Problems and solutions," SIGMOD Record, vol. 32, no. 3, pp. 71-76, 2003.
40. X. Lin, N. Shroff, and R. Srikant, "A tutorial on cross-layer optimization in wireless networks," Submitted, Available Through csl.uiuc.edu/rsrikant, 2006.
41. X. Lin and N. B. Shroff, "Impact of imperfect scheduling in wireless networks," in IEEE INFOCOM, 2005.
42. N. Linial and A. Wigderson, "Lecture notes on Expander Graphs," http://www.math.ias.edu/̃avi/BOOKS/expanderbookr1.pdf.
43. L. Lovasz and P. Winkler, "Mixing times," in Microsurveys in Discrete Probability, DIMACS Series in Discrete Mathematics and Theoretical Computer Science, (D. Aldous and J. Propp, eds.), pp. 85-133, AMS, 1998.
44. M. Luby and N. Nisan, "A parallel approximation algorithm for positive linear programming," in Proceedings of the 25th Annual ACM Symposium on Theory of Computing, pp. 448-457, 1993.
45. R. Madan, D. Shah, and O. Leveque, "Product multi-commodity flow in wireless networks," IEEE Transactions on Information Theory, vol. 54, no. 4, pp. 1460-1476, 2008.
46. S. Madden, M. J. Franklin, J. M. Hellerstein, and W. Hong, "Tag: A tiny aggregation service for ad-hoc sensor networks," SIGOPS Operating Systems Review, vol. 36, no. SI, pp. 131-146, 2002.
47. L. Massoulié and M. Vojnovic, "Coupon replication systems," in ACM SIGMETRICS/Performance, 2005.
48. N. McKeown, "iSLIP: A scheduling algorithm for input-queued switches," IEEE Transactions on Networking, vol. 7, no. 2, pp. 188-201, 1999.
49. N. McKeown, V. Anantharam, and J. Walrand, "Achieving 100% throughput in an input-queued switch," in Proceedings of IEEE Infocom, pp. 296-302, 1996.
50. S. P. Meyn and R. L. Tweedie, Markov Chains and Stochastic Stability. London: Springer-Verlag, 1993.
51. E. Modiano, D. Shah, and G. Zussman, "Maximizing throughput in wireless network via gossiping," in ACM SIGMETRICS/Performance, 2006.
52. R. Montenegro and P. Tetali, "Mathematical aspects of mixing times in Markov chains," Foundations and Trends in Theoretical Computer Science, vol. 1, no. 3, pp. 237-354, 2006.
53. D. Mosk-Aoyama, T. Roughgarden, and D. Shah, "Fully distributed algorithms for convex optimization problems," in International Symposium on Distributed Computation (DISC), 2007.
54. D. Mosk-Aoyama and D. Shah, "Information dissemination via network coding," in IEEE ISIT, 2006.
55. D. Mosk-Aoyama and D. Shah, "Fast distributed algorithms for computing separable functions," IEEE Transactions on Information Theory, vol. 54, no. 7, pp. 2997-3007, 2008.
56. A. Nedic and A. Ozdaglar, "Distributed subgradient methods for multi-agent optimization," LIDS Report 2755, to appear in IEEE Transactions on Automatic Control, 2008.
57. C. Papadimitriou and M. Yannakakis, "Linear programming without the matrix," in Twenty-Fifth Annual ACM Symposium on the Theory of Computing, 1993.
58. M. Penrose, Random Geometric Graphs. Oxford Studies in Probability, Oxford: Oxford University Press, 2003.
59. D. Qiu and R. Srikant, "Modeling and performance analysis of bittorrent-like peer-to-peer networks," in ACM SIGCOMM, pp. 367-378, 2004.
60. S. Rajagopalan, D. Shah, and J. Shin, "Network adiabatic theorem: An efficient randomized protocol for contention resolution," in ACM SIGMETRICS/Performance, 2009.
61. O. Reingold, A. Wigderson, and S. Vadhan, "Entropy waves, The zig-zag graph product, and new constant-degree expanders and extractors," Annals of Mathematics, 2002.
62. T. Rockafellar, Network Flows and Monotropic Optimization. Wiley- Interscience, (republished by Athena Scientific, 1998), 1984.
63. K. Savla, F. Bullo, and E. Frazzoli, "On traveling salesperson problems for Dubinś vehicle: stochastic and dynamic environments," in IEEE CDC-ECC, pp. 4530-4535, Seville, Spain, December 2005.
64. D. Shah, "Stable algorithms for input queued switches," in Proceedings of Allerton Conference on Communication, Control and Computing, 2001.
65. D. Shah and D. J. Wischik, "Optimal scheduling algorithm for input queued switch," in IEEE INFOCOM, 2006.
66. R. Srikant, The Mathematics of Internet Congestion Control. Birkhäuser, 2004.
67. L. Tassiulas and A. Ephremides, "Stability properties of constrained queueing systems and scheduling policies for maximum throughput in multihop radio networks," IEEE Transactions on Automatic Control, vol. 37, pp. 1936-1948, 1992.
68. L. Trevisan, "Non-approximability results for optimization problems on bounded degree instances," in ACM STOC, 2001.
69. J. Tsitsiklis, "Problems in decentralized decision making and computation," PhD dissertation, Lab. Information and Decision Systems, MIT, Cambridge, MA, 1984.
70. www.bbc.co.uk/iplayer.