On the capacity of multiple unicast sessions in undirected graphs

IEEE Transactions on Information Theory

Volumn 52, Issue 6, 2006, Pages 2805-2809

  Jain, Kamal ^a   Vazirani, Vijay V ^b   Yuval, Gideon ^a  

^a MICROSOFT   (United States)

^b Georgia Institute of Technology   (United States)

Author keywords

Cryptography; Entropy calculus; Multicommodity flow; Network capacity; Network coding; Undirected capacity

Indexed keywords

CHANNEL CAPACITY; CRYPTOGRAPHY; DIFFERENTIATION (CALCULUS); ENCODING (SYMBOLS); MULTICASTING;

ENTROPY CALCULUS; MULTICOMMODITY FLOW; NETWORK CAPACITY; NETWORK CODING; UNDIRECTED CAPACITY;

TELECOMMUNICATION NETWORKS;

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

References (12)

1. M. Adler, N. J. A. Harvey, K. Jain, R. D. Kleinberg, and A. R. Lehman, "On the capacity of information networks," in Proc. SODA 2006, 2006.
2. R. Ahlswede, N. Cai, S.-Y. R. Li, and R. W. Yeung, "Network information flow," IEEE Trans. Inf. Theory, vol. 46, pp. 1204-1216, 2000.
3. M. Charikar and A. Argawal, "On the advantage of network coding for improving network throughput," in Proc. 2004 IEEE Inf. Theory Workshop, San Antonio, TX, 2004.
4. N. J. A. Harvey, R. D. Kleinberg, and A. R. Lehman, "On the capacity of information networks," IEEE Trans. Inf. Theory, vol. 52, no. 6, pp. 2345-2364, Jun. 2006.
5. T. Ho, R. Koetter, M. Médard, M. Effros, J. Shi, and D. Karger, "A random linear network coding approach to multicast," IEEE Trans. Inf. Theory, 2005, submitted for publication.
6. K. Jain, "Security based on network topology against the wiretapping attack," IEEE Magazine, Special Issue on Topics in Wireless Security, 2004.
7. R. Koetter and M. Medard, "An algebraic approach to network coding," IEEE/ACM Trans. Netw..
8. G. Kramer and S. A. Savari, "Progressive d-separating edge set bounds on network coding rates," in Proc. IEEE Int. Symp. Information Theory, Adelaide, Australia, Sep. 2005, pp. 1588-1592.
9. Z. Li and B. Li, "Network coding in undirected networks," in Proc. CISS, 2004.
10. F. T. Leighton and S. Rao, "An approximate max-flow min-cut theorem for uniform multicommodity flow problems with application to approximation algorithms," in Proc. 29th Annu. IEEE Symp. Found. Comput. Sci., 1988, pp. 422-431.
11. D. Slepian and J. K. Wolf, "Noiseless coding of correlated information sources," IEEE Trans. Inf. Theory., vol. IT-19, pp. 471-480, Mar. 1973.
12. V. V. Vazirani, Approximation Algorithms. New York: Springer-Verlag, 2001.