Network routing capacity

We define the routing capacity of a network to be the supremum of all possible fractional message throughputs achievable by routing. We prove that the routing capacity of every network is achievable and rational, we present an algorithm for its computation, and we prove that every non-negative rational number is the routing capacity of some network. We also determine the routing capacity for various example networks. Finally, we discuss the extension of routing capacity to fractional coding solutions and show that the coding capacity of a network is independent of the alphabet used

[1]  Christina Fragouli,et al.  On Average Throughput Benefits and Alphabet Size in Network Coding , 2005 .

[2]  Zongpeng Li,et al.  On Achieving Optimal End-to-End Throughput in Data Networks: Theoretical and Empirical Studies , 2004 .

[3]  Muriel Médard,et al.  An algebraic approach to network coding , 2003, TNET.

[4]  Peter Sanders,et al.  Polynomial time algorithms for multicast network code construction , 2005, IEEE Transactions on Information Theory.

[5]  Zongpeng Li,et al.  Network Coding in Undirected Networks , 2004 .

[6]  April Rasala Lehman,et al.  Network coding: does the model need tuning? , 2005, SODA '05.

[7]  April Rasala Lehman,et al.  Complexity classification of network information flow problems , 2004, SODA '04.

[8]  R. Koetter,et al.  Network coding from a network flow perspective , 2003, IEEE International Symposium on Information Theory, 2003. Proceedings..

[9]  Rudolf Ahlswede,et al.  Network information flow , 2000, IEEE Trans. Inf. Theory.

[10]  Shuo-Yen Robert Li,et al.  Linear network coding , 2003, IEEE Trans. Inf. Theory.

[11]  Randall Dougherty,et al.  Insufficiency of linear coding in network information flow , 2005, IEEE Transactions on Information Theory.

[12]  Raymond W. Yeung,et al.  A First Course in Information Theory , 2002 .

[13]  Farhad Shahrokhi,et al.  The maximum concurrent flow problem , 1990, JACM.

[14]  Mohammad R. Salavatipour,et al.  Packing Steiner trees , 2003, SODA '03.

[15]  Raymond W. Yeung,et al.  Network coding gain of combination networks , 2004, Information Theory Workshop.

[16]  Randall Dougherty,et al.  Linearity and solvability in multicast networks , 2004, IEEE Transactions on Information Theory.

[17]  Peter Sanders,et al.  Polynomial time algorithms for network information flow , 2003, SPAA '03.

[18]  Baochun Li,et al.  How Practical is Network Coding? , 2006, 200614th IEEE International Workshop on Quality of Service.

[19]  Randall Dougherty,et al.  Unachievability of network coding capacity , 2006, IEEE Transactions on Information Theory.

[20]  Philip A. Chou,et al.  A comparison of network coding and tree packing , 2004, International Symposium onInformation Theory, 2004. ISIT 2004. Proceedings..

[21]  Dana Ron,et al.  Bounds on Linear Codes for Network Multicast , 2003, Electron. Colloquium Comput. Complex..