On the capacity of information networks

IEEE Transactions on Information Theory

Volumn 52, Issue 6, 2006, Pages 2345-2364

  Harvey, Nicholas J A ^a   Kleinberg, Robert ^b   Lehman, April Rasala ^c  

^a MASSACHUSETTS INSTITUTE OF TECHNOLOGY   (United States)

^b Department of Computer Science and School of Operations Research and Information Engineering   (United States)

^c GOOGLE INC   (United States)

Author keywords

Capacity; Infomational dominance; k pairs communication problems; Multicommodity flow; Multiple unicast sessions; Network coding; Sparsity

Indexed keywords

CHANNEL CAPACITY; ENCODING (SYMBOLS); ENTROPY; GRAPH THEORY; TELECOMMUNICATION NETWORKS;

INFORMATIONAL DOMINANCE; K-PAIRS COMMUNICATION PROBLEMS; MULTICOMMODITY FLOW; MULTIPLE UNICAST SESSIONS; NETWORK CODING; SPARSITY;

INFORMATION THEORY;

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

References (27)

1. T. M. Cover and J. A. Thomas, Elements of Information Theory. New York: Wiley, 1991.
2. A. Schrijver, "On the history of combinatorial optimization (till 1960)," in Discrete Optimization, K. Aardal, G. L. Nemhauser, and R. Weismantel, Eds. Amsterdam, The Netherlands: North-Holland, 2005, vol. 12, Handbooks in Operations Research and Management, pp. 1-68.
3. L. Song, R. Yeung, and N. Cai, "Zero-error network coding for acyclic networks," IEEE Trans. Inf. Theory, vol. 49, pp. 3129-3139, Dec. 2003.
4. Z. Li and B. Li, "Network coding: The case of multiple unicast sessions," in Proc. 42nd Allerton Ann. Conf. Commun., Contr., Comput., Sep. 2004.
5. N. J. A. Harvey, R. D. Kleinberg, and A. R. Lehman, "Comparing network coding with multicommodity flow for the κ-pairs communication problem," MIT LCS, Tech. Rep. 964, 2004.
6. S. P. Borade, "Network information flow: Limits and achievability," in Proc. IEEE Int. Symp. Inf. Theory (ISIT), Jul. 2002.
7. G. Kramer and S. A. Savari, "On networks of two-way channels," in DIMACS Workshop on Algebraic Coding Theory and Information Theory (Dec. 15-18, 2003, Rutgers Univ., Piscataway, NJ), vol. 68, DIMACS series in discrete mathematics and theoretical computer science, A. Ashikhmin and A. Barg, Eds., RI, 2005, pp. 133-143.
8. R. Ahlswede, N. Cai, S.-Y. R. Li, and R. W. Yeung, "Network information flow," IEEE Trans. Inf. Theory, vol. 46, pp. 1204-1216, Jul. 2000.
9. A. Agarwal and M. Charikar, "On the advantage of network coding for improving network throughput," in Proc. IEEE Inf. Theory Workshop, Oct. 2004.
10. Z. Li, B. Li, D. Jiang, and L. C. Lau, "On achieving throughput with network coding," in Proc. 24th Ann. Joint Conf. IEEE Comp. Commun. Soc. (INFOCOM), Mar. 2005.
11. G. Kramer, "Capacity results for the discrete memoryless network," IEEE Trans. Inf. Theory, vol. 49, pp. 4-21, Jan. 2003.
12. G. Kramer, "Directed information channels with feedback," Ph.D., Swiss Federal Inst. Technol. (ETH), Zurich, 1998.
13. K. Jain, V. Vazirani, R. W. Yeung, and G. Yuval, "On the capacity of multiple unicast sessions in undirected graphs," in Proc. IEEE Int. Symp. Inf. Theory (ISIT), Sep. 2005.
14. G. Kramer and S. A. Savari, "Edge-cut bounds on network coding rates," J. Netw. Syst. Manage., vol. 14, no. 1, Mar. 2006, to be published.
15. S.-Y. R. Li, R. W. Yeung, and N. Cai, "Linear network coding," IEEE Trans. Inf. Theory, vol. 49, pp. 371-381, 2003.
16. R. W. Yeung, A First Course in Information Theory. Boston, MA: Kluwer, 2002.
17. Z. Li and B. Li, "Network coding in undirected networks," in Proc. 38th Ann. Conf. Inf. Sci. Syst. (CISS), Mar. 2004.
18. 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, pp. 1973-1982, Jun. 2005.
19. V. Vazirani, Approximation Algorithms. New York: Springer, 2001.
20. J. Cheriyan, H. J. Karloff, and Y. Rabani, "Approximating directed multicuts," in Proc. 42nd Ann. IEEE Symp. Found. Comp. Sci. (FOCS), Oct. 2001, pp. 348-356.
21. T. Leighton and S. Rao, "Multicommodity max-flow min-cut theorems and their use in designing approximation algorithms," J. ACM, vol. 46, no. 6, pp. 787-832, Nov. 1999.
22. A. Schrijver, Combinatorial Optimization: Polyhedra and Efficiency. New York: Springer-Verlag, 2003.
23. M. Sipser, Introduction to the Theory of Computation. Boston, MA: Course Technology, 1996.
24. Z. Zhang and R. W. Yeung, "On characterization of entropy function via information inequalities," IEEE Trans. Inf. Theory, vol. 44, pp. 1440-1452, Jul. 1998.
25. K. Makarychev, Y. Makarychev, A. Romashchenko, and N. Vereshchagin, "A new class of non Shannon type inequalities for entropies," Commun. Inf. Syst., vol. 2, no. 2, pp. 147-166, Dec. 2002.
26. J. Edmonds, "Optimum branchings," J. Res. Nat. Bur. Stand., vol. 71B, pp. 233-240, 1967.
27. H. Okamura and P. Seymour, "Multicommodity flows in planar graphs," J. Combin. Theory, Series B, vol. 31, no. 1, pp. 75-81, 1981.