Connecting multiple-unicast and network error correction: Reduction and unachievability

We show that solving a multiple-unicast network coding problem can be reduced to solving a single-unicast network error correction problem, where an adversary may jam at most a single edge in the network. Specifically, we present an efficient reduction that maps a multiple-unicast network coding instance to a network error correction instance while preserving feasibility. The reduction holds for both the zero probability of error model and the vanishing probability of error model. Previous reductions are restricted to the zero-error case. As an application of the reduction, we present a constructive example showing that the single-unicast network error correction capacity may not be achievable, a result of separate interest.

[1]  Frank R. Kschischang,et al.  Robust Network Coding in the Presence of Untrusted Nodes , 2008, IEEE Transactions on Information Theory.

[2]  Zhen Zhang,et al.  Linear Network Error Correction Codes in Packet Networks , 2008, IEEE Transactions on Information Theory.

[3]  Lang Tong,et al.  Polytope codes against adversaries in networks , 2010, ISIT.

[4]  Tracey Ho,et al.  Resilient network coding in the presence of Byzantine adversaries , 2007, IEEE INFOCOM 2007 - 26th IEEE International Conference on Computer Communications.

[5]  Randall Dougherty,et al.  Unachievability of network coding capacity , 2006, IEEE Transactions on Information Theory.

[6]  Brijesh Kumar Rai,et al.  On Network Coding for Sum-Networks , 2009, IEEE Transactions on Information Theory.

[7]  Ning Cai,et al.  Network Error Correction, I: Basic Concepts and Upper Bounds , 2006, Commun. Inf. Syst..

[8]  Tracey Ho,et al.  Network Error Correction With Unequal Link Capacities , 2010, IEEE Transactions on Information Theory.

[9]  Minghua Chen,et al.  Routing for security in networks with adversarial nodes , 2013, 2013 International Symposium on Network Coding (NetCod).

[10]  Wentao Huang,et al.  Single-source/sink network error correction is as hard as multiple-unicast , 2014, 2014 52nd Annual Allerton Conference on Communication, Control, and Computing (Allerton).

[11]  Lang Tong,et al.  Nonlinear network coding is necessary to combat general Byzantine attacks , 2009, 2009 47th Annual Allerton Conference on Communication, Control, and Computing (Allerton).

[12]  Frank R. Kschischang,et al.  Coding for Errors and Erasures in Random Network Coding , 2008, IEEE Trans. Inf. Theory.