Bernhard Haeupler
ABSTRACT
We introduce projection analysis - a new technique to analyze the stopping time of gossip protocols that are based on random linear network coding (RLNC). Projection analysis drastically simplifies, extends and strengthens previous results. We analyze RLNC gossip in a general framework for network and communication models that encompasses and unifies the models used previously in this context. We show, in most settings for the first time, that the RLNC gossip converges with high probability in optimal time. Most stopping times are of the form O(k + T), where k is the number of messages to be distributed and T is the time it takes to disseminate one message. This means RLNC gossip achieves "perfect pipelining". Our analysis directly extends to highly dynamic networks in which the topology can change completely at any time. This remains true, even if the network dynamics are controlled by a fully adaptive adversary that knows the complete network state. Virtually nothing besides simple O(kT) sequential flooding protocols was previously known for such a setting.
While RLNC gossip works in this wide variety of networks our analysis remains the same and extremely simple. This contrasts with more complex proofs that were put forward to give less strong results for various special cases.
Supplemental Material
- 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. Google Scholar
Digital Library
- R. Ahlswede, N. Cai, S. Li, and R. Yeung. Network information flow. Transactions on Information Theory (TransInf), 46(4):1204--1216, 2000. Google ScholarDigital Library
- J. Aspnes and E. Ruppert. An introduction to population protocols. Middleware for Network Eccentric and Mobile Applications, pages 97--120, 2009.Google ScholarCross Ref
- 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.Google ScholarCross Ref
- 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. Google ScholarDigital Library
- 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.Google Scholar
- 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. Google ScholarDigital Library
- 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.Google Scholar
- 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.Google ScholarCross Ref
- 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. Google ScholarDigital Library
- 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. Google ScholarDigital Library
- Y. Fernandess and D. Malkhi. On collaborative content distribution using multi-message gossip. Journal of Parallel and Distributed Computing, 67(12):1232--1239, 2007. Google ScholarDigital Library
- C. Fragouli, J. Le Boudec, and J. Widmer. Network Coding: An Instant Primer. Computer Communication Review, 36(1):63, 2006. Google ScholarDigital Library
- C. Fragouli, J. Widmer, and J.-Y. Le Boudec. Efficient broadcasting using network coding. Transactions on Networking (TON), 16(2):450--463, 2008. Google ScholarDigital Library
- 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.Google ScholarCross Ref
- Z. J. Haas, J. Y. Halpern, and L. Li. Gossip-based ad hoc routing. Transactions on Networking (TON), 14(3):479--491, 2006. Google ScholarDigital Library
- B. Haeupler and D. Karger. Faster Information Dissemination in Dynamic Networks. In Proc. of the 30th Symposium on Principles of Distributed Computing (PODC), 2011. Google ScholarDigital Library
- B. Haeupler, M. Kim, and M. Médard. Optimality of Network Coding in Packet Networks. ArXiv:1102.3569, 2011.Google Scholar
- B. Haeupler and M. Médard. One Packet Suffices - Highly Efficient Packetized Network Coding With Finite Memory. ArXiv:1102.3204, 2011.Google Scholar
- S. M. Hedetniemi, S. T. Hedetniemi, and A. L. Liestman. A survey of gossiping and broadcasting in communication networks. Networks, 18:319--349, 1988.Google ScholarCross Ref
- 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. Google ScholarDigital Library
- 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. Google ScholarDigital Library
- 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. Google ScholarDigital Library
- 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. Google ScholarDigital Library
- 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. Google ScholarDigital Library
- D. Kempe, J. Kleinberg, and A. Demers. Spatial gossip and resource location protocols. Journal of the ACM (JACM), 51(6):943--967, 2004. Google ScholarDigital Library
- 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. Google ScholarDigital Library
- S. Li, R. Yeung, and N. Cai. Linear network coding. Transactions on Information Theory (TransInf), 49(2):371--381, 2003. Google ScholarDigital Library
- Y. Minski. Spreading rumors cheaply, quickly, and reliably. PhD thesis, Cornell University, 2002. Google ScholarDigital Library
- 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.Google ScholarCross Ref
- D. Vasudevan and S. Kudekar. Algebraic gossip on Arbitrary Networks. ArXiv:0901.1444, 2009.Google Scholar
Index Terms
- Analyzing network coding gossip made easy
Recommendations
Analyzing Network Coding (Gossip) Made Easy
We introduce projection analysis—a new technique to analyze the stopping time of protocols that are based on random linear network coding (RLNC). Projection analysis drastically simplifies, extends, and strengthens previous results on RLNC gossip ...
Block-Markov encoding with network coding for cooperative communications
In this paper, we propose network coding as an operational implementation of information theoretic block-Markov coding for cooperative communications. This is a transmission strategy where users act as a relay for each other to help reliable recovery of ...
Peer-to-Peer File Sharing Based on Network Coding
ICDCS '08: Proceedings of the 2008 The 28th International Conference on Distributed Computing SystemsNetwork coding is a promising enhancement of routing to improve network throughput and provide high reliability. It allows a node to generate output messages by encoding its received messages. Peer-to-peer networks are a perfect place to apply network ...
Comments