TY - GEN
T1 - Arbitrarily varying networks
T2 - 2016 IEEE International Symposium on Information Theory, ISIT 2016
AU - Tian, Peida
AU - Jaggi, Sidharth
AU - Bakshi, Mayank
AU - Kosut, Oliver
N1 - Funding Information:
The work of P. Tian, S. Jaggi, and M. Bakshi described in this paper was partially supported by a grant from University Grants Committee of the Hong Kong Special Administrative Region, China (Project No. AoE/E-02/08) This material is based upon work supported by the National Science Foundation under Grant No. CCF-1422358
Publisher Copyright:
© 2016 IEEE.
PY - 2016/8/10
Y1 - 2016/8/10
N2 - We consider the problem of communication over a network containing a hidden and malicious adversary that can control a subset of network resources, and aims to disrupt communications. We focus on omniscient node-based adversary, i.e., the adversary can control a subset of nodes, and knows the message, network code and packets on all links. Characterizing information-theoretically optimal communication rates as a function of network parameters and bounds on the adversarially controlled network is in general open, even for unicast (single source, single destination) problems. In this work we characterize the information-theoretically optimal randomized capacity of such problems, i.e., under the assumption that the source node shares (an asymptotically negligible amount of) independent common randomness with each network node a priori. We propose a novel computationally-efficient communication scheme whose rate matches a natural information-theoretically 'erasure outer bound' on the optimal rate. Our schemes require no prior knowledge of network topology, and can be implemented in a distributed manner as an overlay on top of classical distributed linear network coding.
AB - We consider the problem of communication over a network containing a hidden and malicious adversary that can control a subset of network resources, and aims to disrupt communications. We focus on omniscient node-based adversary, i.e., the adversary can control a subset of nodes, and knows the message, network code and packets on all links. Characterizing information-theoretically optimal communication rates as a function of network parameters and bounds on the adversarially controlled network is in general open, even for unicast (single source, single destination) problems. In this work we characterize the information-theoretically optimal randomized capacity of such problems, i.e., under the assumption that the source node shares (an asymptotically negligible amount of) independent common randomness with each network node a priori. We propose a novel computationally-efficient communication scheme whose rate matches a natural information-theoretically 'erasure outer bound' on the optimal rate. Our schemes require no prior knowledge of network topology, and can be implemented in a distributed manner as an overlay on top of classical distributed linear network coding.
UR - http://www.scopus.com/inward/record.url?scp=84985930378&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=84985930378&partnerID=8YFLogxK
U2 - 10.1109/ISIT.2016.7541677
DO - 10.1109/ISIT.2016.7541677
M3 - Conference contribution
AN - SCOPUS:84985930378
T3 - IEEE International Symposium on Information Theory - Proceedings
SP - 2139
EP - 2143
BT - Proceedings - ISIT 2016; 2016 IEEE International Symposium on Information Theory
PB - Institute of Electrical and Electronics Engineers Inc.
Y2 - 10 July 2016 through 15 July 2016
ER -