Network routing capacity

IEEE Transactions on Information Theory

Volumn 52, Issue 3, 2006, Pages 777-788

  Cannons, Julian ^a,b   Dougherty, Randall ^c   Freiling, Chris ^d   Zeger, Kenneth ^a,b  

^a IEEE   (United States)

^b UNIVERSITY OF CALIFORNIA   (United States)

^c CENTER FOR COMMUNICATIONS RESEARCH   (United States)

^d CALIFORNIA STATE UNIVERSITY   (United States)

Author keywords

Capacity; Flow; Network coding; Switching

Indexed keywords

FRACTIONAL CODING SOLUTIONS; NETWORK CODING; ROUTING CAPACITY;

COMPUTATIONAL METHODS; INFORMATION ANALYSIS; PROBLEM SOLVING; ROUTING ALGORITHMS; SIGNAL ENCODING;

TELECOMMUNICATION NETWORKS;

EID: 33745150095     PISSN: 00189448     EISSN: None     Source Type: Journal    
DOI: 10.1109/TIT.2005.864474     Document Type: Article

References (24)

1. R. Ahlswede, N. Cai, S.-Y. R. Li, and R. W. Yeung, "Network information flow," IEEE Trans. Inf. Theory, vol. 46, no. 4, pp. 1204-1216, Jul. 2000.
2. C. Chekuri, C. Fragouli, and E. Soljanin, "On average throughput benefits and alphabet size in network coding," IEEE Trans. Inf. Theory, submitted for publication.
3. P. A. Chou, Y. Wu, and K. Jain, "Practical network coding," Proc. Allerton Conf. Communication, Control, and Computing, Oct. 2003.
4. R. Dougherty, C. Freiling, and K. Zeger, "Linearity and solvability in multicast networks," IEEE Trans. Inf. Theory, vol. 50, no. 10, pp. 2243-2256, Oct. 2004.
5. _, "Insufficiency of linear coding in network information flow," IEEE Trans. Inf. Theory, vol. 51, no. 8, pp. 2745-2759, Aug. 2005.
6. _, "Unachievability of network coding capacity," IEEE Trans. Information Theory (Joint Special Issue with IEEE/ACM Trans. Netw.), to be published.
7. M. Feder, D. Ron, and A. Tavory, "Bounds on linear codes for network multicast," in Electronic Colloquium on Computational Complexity (ECCC), 2003, Rep. 33, pp. 1-9.
8. T. Ho, D. Karger, M. Medard, and R. Koetter, "Network coding from a network flow perspective," in Proc. IEEE Int. Symp. Information Theory, Yokohama, Japan, Jun./Jul. 2003, p. 441.
9. F. K. Hwang, D. S. Richards, and P. Winter, The Steiner Tree Problem, Volume 53 of the Annals of Discrete Mathematics. Amsterdam, The Netherlands: Elsevier Science Publishers (North-Holland), 1992.
10. S. Jaggi, P. Sanders, P. A. Chou, M. Effros, S. Egner, K. Jain, and L. Tolhuizen, "Polynomial time algorithms for multicast network code construction," IEEE Trans. Inf. Theory, vol. 51, no. 6, pp. 1973-1982, Jun. 2005.
11. K. Jain, M. Mahdian, and M. Salavatipour, "Packing Steiner trees," in Proc. 14th Annual ACM-SIAM Symp. Discrete Algorithms, Baltimore, MD, Jan. 2003, pp. 266-274.
12. R. Koetter and M. Médard, "An algebraic approach to network coding," IEEE/ACM Trans. Netw., vol. 11, no. 5, pp. 782-795, Oct. 2003.
13. Z. Li and B. Li, "Network coding in undirected networks," in Proc. 38th Annu. Conf. Information Sciences and Systems (CISS), Princeton, NJ, Mar. 2004. Paper #603.
14. Z. Li, B. Li, D. Jiang, and L. C. Lau. (2004, Feb.) On achieving optimal end-to-end throughput in data networks: Theoretical and empirical studies. ECE Tech. Rep., Dep. Elec. Comp. Eng., Univ. Toronto, Toronto, ON, Canada. [Online]. Available: http://www.eecg.toronto.edu-bli/research.html
15. S.-Y. R. Li, R. W. Yeung, and N. Cai, "Linear network coding," IEEE Trans. Inf. Theory, vol. 49, no. 2, pp. 371-381, Feb. 2003.
16. M. Médard, M. Effros, T. Ho, and D. Karger, "On coding for non-multicast networks," in Proc. 41st Annu. Allerton Conf. Communication Control and Computing, Monticello, IL, Oct. 2003.
17. C. K. Ngai and R. W. Yeung, "Network coding gain of combination networks," in Proc. IEEE Information Theory Workshop (ITW), San Antonio, YX, Jan. 2005.
18. A. Rasala Lehman and E. Lehman, "Complexity classification of network information flow problems," in Proc. 41st Annu. Allerton Conf. Communication Control and Computing, Monticello, IL, Oct. 2003.
19. _, "Network information flow: Does the model need tuning?," in Proc. Symp. Discrete Algorithms (SODA), Vancouver, BC, Canada, Jan. 2005, pp. 499-504.
20. S. Riis, "Linear versus nonlinear boolean functions in network flow," in Proc. 38th Annu. Conf. Information Sciences and Systems (CISS), Princeton, NJ, Mar. 2004.
21. P. Sanders, S. Egner, and L. Tolhuizen, "Polynomial time algorithms for network information flow," in Proc. 15th ACM Symp. Parallelism in Algorithms and Architectures (SPAA), San Diego, CA, Jun. 2003, pp. 286-294.
22. F. Shahrokhi and D. W. Matula, "The maximum concurrent flow problem," J. ACM, vol. 37, no. 2, pp. 318-334, 1990.
23. Y. Wu, P. A. Chou, and K. Jain, "A comparison of network coding and tree packing," in Proc. IEEE Int. Symp. Information Theory, Chicago, IL, Jun./Jul. 2004, p. 145.
24. R. W. Yeung, A First Course in Information Theory. New York: Kluwer, 2002.