Equivalence for Networks With Adversarial State

We address the problem of finding the capacity of noisy networks with either independent point-to-point compound channels (CC) or arbitrarily varying channels (AVC). These channels model the presence of a Byzantine adversary, which controls a subset of links or nodes in the network. We derive equivalence results showing that these point-to-point channels with state can be replaced by noiseless bit-pipes without changing the network capacity region. Exact equivalence results are found for the CC model, and for some instances of the AVC, including all nonsymmetrizable AVCs. These results show that a feedback path between the output and input of a CC can increase the equivalent capacity, and that if common randomness can be established between the terminals of an AVC (either by a feedback, a forward path, or via a third-party node), then again the equivalent capacity can increase. This leads to an observation that deleting an edge of arbitrarily small capacity can cause a significant change in network capacity. We also analyze an example involving an AVC for which no fixed-capacity bit-pipe is equivalent.

[1]  D. Blackwell,et al.  The Capacities of Certain Channel Classes Under Random Coding , 1960 .

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

[3]  Prakash Narayan,et al.  Reliable Communication Under Channel Uncertainty , 1998, IEEE Trans. Inf. Theory.

[4]  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).

[5]  Imre Csiszár,et al.  The capacity of the arbitrarily varying channel revisited: Positivity, constraints , 1988, IEEE Trans. Inf. Theory.

[6]  R. Ahlswede Elimination of correlation in random codes for arbitrarily varying channels , 1978 .

[7]  Imre Csiszár,et al.  Information Theory - Coding Theorems for Discrete Memoryless Systems, Second Edition , 2011 .

[8]  Brian L. Hughes The smallest list for the arbitrarily varying channel , 1997, IEEE Trans. Inf. Theory.

[9]  Thomas M. Cover,et al.  Elements of Information Theory , 2005 .

[10]  Moritz Wiese,et al.  The Arbitrarily Varying Wiretap Channel - Secret Randomness, Stability, and Super-Activation , 2016, IEEE Trans. Inf. Theory.

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

[12]  Runyao Duan,et al.  Super-Activation of Zero-Error Capacity of Noisy Quantum Channels , 2009, 0906.2527.

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

[14]  Yu Xiang,et al.  A few meta-theorems in network information theory , 2014, 2014 IEEE Information Theory Workshop (ITW 2014).

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

[16]  H. Vincent Poor,et al.  On the Continuity of the Secrecy Capacity of Compound and Arbitrarily Varying Wiretap Channels , 2014, IEEE Transactions on Information Forensics and Security.

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

[18]  Mayank Bakshi,et al.  On equivalence for networks of noisy channels under byzantine attacks , 2011, 2011 IEEE International Symposium on Information Theory Proceedings.

[19]  J. Wolfowitz,et al.  Coding Theorems of Information Theory , 1964, Ergebnisse der Mathematik und Ihrer Grenzgebiete.

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

[21]  Alon Orlitsky,et al.  Coding for computing , 1995, Proceedings of IEEE 36th Annual Foundations of Computer Science.

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

[23]  D. Blackwell,et al.  The Capacity of a Class of Channels , 1959 .