One packet suffices - Highly efficient packetized Network Coding with finite memory

IEEE International Symposium on Information Theory - Proceedings

Volumn , Issue , 2011, Pages 1151-1155

  Haeupler, Bernhard ^a   Médard, Muriel ^b  

^a MASSACHUSETTS INSTITUTE OF TECHNOLOGY   (United States)

^b MASSACHUSETTS INSTITUTE OF TECHNOLOGY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

CODING COMPLEXITY; DYNAMIC TOPOLOGIES; FINITE MEMORY; HIGH-THROUGHPUT; INTERMEDIATE NODE; MEMORY RESOURCES; MULTICASTS; NETWORK MODELS; PROJECTION ANALYSIS; QUEUING THEORY; SUCCINCT REPRESENTATION;

INFORMATION DISSEMINATION; INFORMATION THEORY; OPTIMIZATION; QUEUEING THEORY;

NETWORK CODING;

EID: 80054812916     PISSN: 21578104     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ISIT.2011.6033713     Document Type: Conference Paper

References (17)

1. T. Ho, M. Médard, R. Koetter, D. Karger, M. Effros, J. Shi, and B. Leong, "A random linear network coding approach to multicast", IEEE Transactions on Information Theory (TransInf), vol. 52, no. 10, pp. 4413-4430, 2006.
2. A. Dana, R. Gowaikar, R. Palanki, B. Hassibi, and M. Effros, "Capacity of wireless erasure networks", IEEE Transactions on Information Theory (TransInf), vol. 52, no. 3, pp. 789-804, 2006.
3. D. Lun, M. Médard, R. Koetter, and M. Effros, "On coding for reliable communication over packet networks", Physical Communication, vol. 1, no. 1, pp. 3-20, 2008.
4. -, "Further results on coding for reliable communication over packet networks", in Proc. of the IEEE International Symposium on Information Theory (ISIT), 2005, pp. 1848-1852.
5. P. Chou, Y. Wu, and K. Jain, "Practical network coding", in Proc. of the 41st Allerton Conference on Communication Control and Computing, vol. 41, 2003, pp. 40-49.
6. 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.
7. S. Deb, M. Médard, and C. Choute, "On random network coding based information dissemination", in Proc. of the International Symposium on Information Theory (ISIT), 2005, pp. 278-282.
8. M. Borokhovich, C. Avin, and Z. Lotker, "Tight bounds for algebraic gossip on graphs", in Proc. of the IEEE International Symposium on Information Theory (ISIT), 2010, pp. 1758-1762.
9. D. Mosk-Aoyama and D. Shah, "Information dissemination via network coding", in Proc. of the IEEE International Symposium on Information Theory (ISIT), 2006, pp. 1748-1752.
10. B. Haeupler and D. Karger, "Network Coding: Beating Token Forwarding Lower Bounds in Dynamic Networks", in submission, 2011.
11. B. Haeupler, "Analyzing Network Coding Gossip Made Easy", in Proc. of the 43nd Symposium on Theory of Computing (STOC), 2011.
12. D. S. Lun, P. Pakzad, C. Fragouli, M. Médard, and R. Koetter, "An analysis of finite-memory random linear coding on packet streams", in Proc. of the International Symposium on Modeling and Optimization in Mobile, Ad Hoc and Wireless Networks (WiOpt), 2006, pp. 1-6.
13. J. Sundararajan, D. Shah, and M. Médard, "On queueing in coded networks-queue size follows degrees of freedom", in IEEE Information Theory Workshop on Information Theory for Wireless Networks (ITW), 2007, pp. 1-6.
14. K. Sundararajan, D. Shah, and M. Médard, "ARQ for network coding", in Proc. of the IEEE International Symposium on Information Theory (ISIT), 2008, pp. 1651-1655.
15. S. Bhadra and S. Shakkottai, "Looking at Large Networks: Coding vs. Queueing", in Proc. of the 25th IEEE International Conference on Computer Communications (INFOCOM), 2007, pp. 1-12.
16. F. Kuhn, N. Lynch, and R. Oshman, "Distributed computation in dynamic networks", in Proc. of the 42nd Symposium on Theory of Computing (STOC), 2010, pp. 557-570.
17. B. Haeupler, M. Kim, and M. Médard, "Optimality of Network Coding in Packetized Networks", ArXiv, 2011.