A reduction approach to the multiple-unicast conjecture in network coding

The multiple-unicast conjecture in network coding states that for multiple unicast sessions in an undirected network, network coding has no advantage over routing in improving the throughput or saving bandwidth. In this work, we propose a reduction method to study the multiple-unicast conjecture, and prove the conjecture for a new class of networks that are characterized by relations between cut-sets and source-receiver paths. This class subsumes the two known types of networks with non-zero max-flow min-cut gaps. Further combing this result with a computer-aided search, we derive as a corollary that network coding is unnecessary in networks with up to 6 nodes. We also prove the multiple-unicast conjecture for almost all unit-link-length networks with up to 3 sessions and 7 nodes.

[1]  Abbas Yongaçoglu,et al.  On the k-pairs problem , 2008, 2008 IEEE International Symposium on Information Theory.

[2]  T. C. Hu.  Multi-Commodity Network Flows , 1963 .

[3]  Robert D. Kleinberg,et al.  Comparing Network Coding with Multicommodity Flow for the k-pairs Communication Problem , 2004 .

[4]  Vijay V. Vazirani,et al.  On the capacity of multiple unicast sessions in undirected graphs , 2005, Proceedings. International Symposium on Information Theory, 2005. ISIT 2005..

[5]  Robert D. Kleinberg,et al.  On the capacity of information networks , 2006, IEEE Transactions on Information Theory.

[6]  Baochun Li,et al.  Network Coding : The Case of Multiple Unicast Sessions , 2004 .

[7]  Amit Chakrabarti,et al.  When the cut condition is enough: a complete characterization for multiflow problems in series-parallel networks , 2012, STOC '12.

[8]  Shyamkishor Kumar.  NETWORK CODING THE CASE OF MULTIPLE UNICAST SESSIONS , 2015 .

[9]  Derrick Stolee,et al.  Isomorph-free generation of 2-connected graphs with applications , 2011, 1104.5261.

[10]  Zongpeng Li,et al.  A Geometric Perspective to Multiple-Unicast Network Coding , 2014, IEEE Transactions on Information Theory.

[11]  M. Medard,et al.  On the multiple unicast network coding, conjecture , 2009, 2009 47th Annual Allerton Conference on Communication, Control, and Computing (Allerton).