Analyzing network coding gossip made easy

Proceedings of the Annual ACM Symposium on Theory of Computing

Volumn , Issue , 2011, Pages 293-302

  Haeupler, Bernhard ^a  

^a MASSACHUSETTS INSTITUTE OF TECHNOLOGY   (United States)

Author keywords

dynamic networks; gossip; multicast; network coding

Indexed keywords

COMPUTATION THEORY; LINEAR NETWORKS; MULTICASTING;

ADAPTIVE ADVERSARY; COMMUNICATION MODELS; COMPLETE NETWORKS; DYNAMIC NETWORK; FLOODING PROTOCOL; GOSSIP; PROJECTION ANALYSIS; RANDOM LINEAR NETWORK CODING;

NETWORK CODING;

EID: 79959749930     PISSN: 07378017     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1993636.1993676     Document Type: Conference Paper

References (31)

1. D. Agrawal, A. El Abbadi, and R. C. Steinke. Epidemic algorithms in replicated databases (extended abstract). In Proc. of the 16th Symposium on Principles of Database Systems (PODS), pages 161-172, 1997.
2. R. Ahlswede, N. Cai, S. Li, and R. Yeung. Network information flow. Transactions on Information Theory (TransInf), 46(4):1204-1216, 2000.
3. J. Aspnes and E. Ruppert. An introduction to population protocols. Middleware for Network Eccentric and Mobile Applications, pages 97-120, 2009.
4. M. Borokhovich, C. Avin, and Z. Lotker. Tight Bounds for Algebraic Gossip on Graphs. In Proc. of the Int'l Symposium on Information Theory (ISIT), pages 1758-1762, 2010.
5. F. Chierichetti, S. Lattanzi, and A. Panconesi. Almost tight bounds for rumour spreading with conductance. In Proc. of the 42nd Symposium on Theory of Computing (STOC), pages 399-408, 2010.
6. P. Chou, Y. Wu, and K. Jain. Practical network coding. In Proc. of the 41st Allerton Conference on Communication Control and Computing, pages 40-49, 2003.
7. A. Clementi, A. Monti, F. Pasquale, and R. Silvestri. Information spreading in stationary Markovian evolving graphs. In Proc. of the Int'l Symposium on Parallel & Distributed Processing (IPDPS), pages 1-12, 2009.
8. S. Deb and M. Médard. Algebraic gossip: a network coding approach to optimal multiple rumor mongering. In Proc. of the 42rd Allerton Conference on Communication, Control, and Computing, 2004.
9. S. Deb, M. Médard, and C. Choute. On random network coding based information dissemination. In Proc. of the Int'l Symposium on Information Theory (ISIT), pages 278 -282, 2005.
10. S. Deb, M. Médard, and C. Choute. Algebraic gossip: a network coding approach to optimal multiple rumor mongering. Transactions on Information Theory (TransInf), 52(6):2486-2507, 2006. (Pubitemid 43898905)
11. 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. of the 6th Symposium on Principles of Distributed Computing (PODC), pages 1-12, 1987.
12. Y. Fernandess and D. Malkhi. On collaborative content distribution using multi-message gossip. Journal of Parallel and Distributed Computing, 67(12):1232-1239, 2007. (Pubitemid 350064352)
13. C. Fragouli, J. Le Boudec, and J. Widmer. Network Coding: An Instant Primer. Computer Communication Review, 36(1):63, 2006.
14. C. Fragouli, J. Widmer, and J.-Y. Le Boudec. Efficient broadcasting using network coding. Transactions on Networking (TON), 16(2):450-463, 2008. (Pubitemid 351578230)
15. C. Gkantsidis and P. Rodriguez. Network coding for large scale content distribution. In Proc. of the 24th Int'l Conference on Computer Communications (INFOCOM), volume 4, pages 2235-2245, 2005.
16. Z. J. Haas, J. Y. Halpern, and L. Li. Gossip-based ad hoc routing. Transactions on Networking (TON), 14(3):479-491, 2006. (Pubitemid 43985040)
17. B. Haeupler and D. Karger. Faster Information Dissemination in Dynamic Networks. In Proc. of the 30th Symposium on Principles of Distributed Computing (PODC), 2011.
18. B. Haeupler, M. Kim, and M. Médard. Optimality of Network Coding in Packet Networks. ArXiv:1102.3569, 2011.
19. B. Haeupler and M. Médard. One Packet Suffices - Highly Efficient Packetized Network Coding With Finite Memory. ArXiv:1102.3204, 2011.
20. S. M. Hedetniemi, S. T. Hedetniemi, and A. L. Liestman. A survey of gossiping and broadcasting in communication networks. Networks, 18:319-349, 1988.
21. T. Ho, M. Médard, R. Koetter, D. Karger, M. Effros, J. Shi, and B. Leong. A random linear network coding approach to multicast. Transactions on Information Theory (TransInf ), 52(10):4413-4430, 2006. (Pubitemid 46445282)
22. R. Karp, C. Schindelhauer, S. Shenker, and B. Vöcking. Randomized rumor spreading. In Proc. of the 41st Symposium on Foundations of Computer Science (FOCS), pages 565-574, 2000.
23. S. Katti, H. Rahul, W. Hu, D. Katabi, M. Médard, and J. Crowcroft. XORs in the air: practical wireless network coding. Transactions on Networking (TON), 16(3):497-510, 2008.
24. D. Kempe, A. Dobra, and J. Gehrke. Gossip-based computation of aggregate information. In Proc. of the 44th Symposium on Foundations of Computer Science (FOCS), pages 482-491, 2003.
25. D. Kempe and J. Kleinberg. Protocols and impossibility results for gossip-based communication mechanisms. In Proc. of the 43rd Symposium on Foundations of Computer Science (FOCS), pages 471-480, 2002.
26. D. Kempe, J. Kleinberg, and A. Demers. Spatial gossip and resource location protocols. Journal of the ACM (JACM), 51(6):943-967, 2004. (Pubitemid 40818311)
27. F. Kuhn, N. Lynch, and R. Oshman. Distributed computation in dynamic networks. In Proc. of the 42nd Symposium on Theory of Computing (STOC), pages 557-570, 2010.
28. S. Li, R. Yeung, and N. Cai. Linear network coding. Transactions on Information Theory (TransInf ), 49(2):371-381, 2003.
29. Y. Minski. Spreading rumors cheaply, quickly, and reliably. PhD thesis, Cornell University, 2002.
30. D. Mosk-Aoyama and D. Shah. Information dissemination via network coding. In Proc. of the Int'l Symposium on Information Theory (ISIT), pages 1748-1752, 2006.
31. D. Vasudevan and S. Kudekar. Algebraic gossip on Arbitrary Networks. ArXiv:0901.1444, 2009.