Edge removal in undirected networks

The edge-removal problem asks whether the removal of a λ-capacity edge from a given network can decrease the communication rate between source-terminal pairs by more than λ. In this short manuscript, we prove that for undirected networks, removing a λ-capacity edge decreases the rate by O(λ). Through previously known reductive arguments, here newly applied to undirected networks, our result implies that the zero-error capacity region of an undirected network equals its vanishing-error capacity region. Whether it is possible to prove similar results for directed networks remains an open question.

[1]  Michael Langberg,et al.  Network coding: Is zero error always possible? , 2011, 2011 49th Annual Allerton Conference on Communication, Control, and Computing (Allerton).

[2]  Christina Fragouli,et al.  On average throughput and alphabet size in network coding , 2006, IEEE Transactions on Information Theory.

[3]  Michael Langberg,et al.  On tightness of an entropic region outer bound for network coding and the edge removal property , 2016, 2016 IEEE International Symposium on Information Theory (ISIT).

[4]  Zongpeng Li,et al.  Bounding the Coding Advantage of Combination Network Coding in Undirected Networks , 2012, IEEE Transactions on Information Theory.

[5]  Bernhard Haeupler,et al.  Network Coding Gaps for Completion Times of Multiple Unicasts , 2019, 2020 IEEE 61st Annual Symposium on Foundations of Computer Science (FOCS).

[6]  Michael Langberg,et al.  On a capacity equivalence between network and index coding and the edge removal problem , 2013, 2013 IEEE International Symposium on Information Theory.

[7]  Mark Braverman,et al.  Network coding in undirected graphs is either very helpful or not helpful at all , 2017, ITCS.

[8]  Alex J. Grant,et al.  Network Coding Capacity Regions via Entropy Functions , 2012, IEEE Transactions on Information Theory.

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

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

[11]  Tracey Ho,et al.  On equivalence between network topologies , 2010, 2010 48th Annual Allerton Conference on Communication, Control, and Computing (Allerton).

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

[13]  E. Gilbert.  A comparison of signalling alphabets , 1952 .

[14]  Zongpeng Li,et al.  On achieving maximum multicast throughput in undirected networks , 2006, IEEE Transactions on Information Theory.

[15]  Kai Cai,et al.  On network coding advantage for multiple unicast networks , 2015, 2015 IEEE International Symposium on Information Theory (ISIT).

[16]  Alex J. Grant,et al.  On capacity regions of non-multicast networks , 2010, 2010 IEEE International Symposium on Information Theory.

[17]  Michelle Effros.  On dependence and delay: Capacity bounds for wireless networks , 2012, 2012 IEEE Wireless Communications and Networking Conference (WCNC).

[18]  Zongpeng Li,et al.  Network Coding in Undirected Networks , 2004 .

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

[20]  Tracey Ho,et al.  On the impact of a single edge on the network coding capacity , 2011, 2011 Information Theory and Applications Workshop.

[21]  Rudolf Ahlswede,et al.  Network information flow , 2000, IEEE Trans. Inf. Theory.

[22]  Muriel Médard,et al.  A Theory of Network Equivalence— Part I: Point-to-Point Channels , 2011, IEEE Transactions on Information Theory.

[23]  Zongpeng Li,et al.  A Constant Bound on Throughput Improvement of Multicast Network Coding in Undirected Networks , 2009, IEEE Transactions on Information Theory.

[24]  Michael Langberg,et al.  Source coding for dependent sources , 2012, 2012 IEEE Information Theory Workshop.

[25]  Michael Langberg,et al.  The Edge-Removal Problem’s Connections to the Zero-Error and $\delta$ -Dependence Problems in Network Coding , 2020, IEEE Transactions on Information Theory.

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

[27]  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..

[28]  Michael Langberg,et al.  On an equivalence of the reduction of k-unicast to 2-unicast capacity and the edge removal property , 2015, 2015 IEEE International Symposium on Information Theory (ISIT).