Title :
On the capacity of multiple unicast sessions in undirected graphs
Author :
Jain, Kamal ; Vazirani, Vijay V. ; Yeung, Raymond ; Yuval, Gideon
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 K3,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
Keywords :
calculus; directed graphs; encoding; entropy; telecommunication networks; Li-Li conjecture; arbitrary directed bipartite network; coding gain; entropy calculus; multiple unicast sessions capacity; network coding; source-sink pairs; undirected graphs; undirected network; Approximation algorithms; Broadcasting; Calculus; Entropy; Galois fields; Information rates; Intelligent networks; Network coding; Throughput; Unicast;
Conference_Titel :
Information Theory, 2005. ISIT 2005. Proceedings. International Symposium on
Conference_Location :
Adelaide, SA
Print_ISBN :
0-7803-9151-9
DOI :
10.1109/ISIT.2005.1523398
