On the capacity of multiple unicast sessions in undirected graphs

Authors:
Kamal Jain;Vijay V. Vazirani;Gideon Yuval
Affiliations:
Microsoft, Inc., Redmond, WA;College of Computing, Georgia Institute of Technology, Atlanta, GA;Microsoft, Inc., Redmond, WA
Venue:
IEEE/ACM Transactions on Networking (TON) - Special issue on networking and information theory
Year:
2006

Citing 7
Cited 3

Approximation algorithms

Approximation algorithms
An algebraic approach to network coding

IEEE/ACM Transactions on Networking (TON)
On the capacity of information networks

SODA '06 Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm
Security based on network topology against the wiretapping attack

IEEE Wireless Communications
Network information flow

IEEE Transactions on Information Theory
On the capacity of information networks

IEEE Transactions on Information Theory
A Random Linear Network Coding Approach to Multicast

IEEE Transactions on Information Theory

A constant bound on throughput improvement of multicast network coding in undirected networks

IEEE Transactions on Information Theory
On the multiple unicast network coding conjecture

Allerton'09 Proceedings of the 47th annual Allerton conference on Communication, control, and computing
Quantum network communication: the butterfly and beyond

IEEE Transactions on Information Theory

Quantified Score

Hi-index	0.12

Visualization

Abstract

Li and Li conjectured that in an undirected network with multiple unicast sessions, network coding does not lead to any coding gain. Surprisingly enough, this conjecture could not so far be verified even for the simple network consisting of K 3, 2 with four source-sink pairs. Using entropy calculus, we provide the first verification of the Li-Li conjecture for this network. We extend our bound to the case of an arbitrary directed bipartite network.