Abstract

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.

Original languageEnglish (US)
Article number7920294
Pages (from-to)4137-4154
Number of pages18
JournalIEEE Transactions on Information Theory
Volume63
Issue number7
DOIs
StatePublished - Jul 1 2017

Fingerprint

equivalence
Pipe
Feedback
cause

Keywords

  • Active adversary
  • Arbitrarily-varying channel
  • Capacity
  • Compound channel
  • Equivalence
  • Network security

ASJC Scopus subject areas

  • Information Systems
  • Computer Science Applications
  • Library and Information Sciences

Cite this

Equivalence for networks with adversarial state. / Kosut, Oliver; Kliewer, Jörg.

In: IEEE Transactions on Information Theory, Vol. 63, No. 7, 7920294, 01.07.2017, p. 4137-4154.

Research output: Contribution to journalArticle

Kosut, Oliver ; Kliewer, Jörg. / Equivalence for networks with adversarial state. In: IEEE Transactions on Information Theory. 2017 ; Vol. 63, No. 7. pp. 4137-4154.
@article{7b67aea4e978495f9dcd29e9018e5edf,
title = "Equivalence for networks with adversarial state",
abstract = "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.",
keywords = "Active adversary, Arbitrarily-varying channel, Capacity, Compound channel, Equivalence, Network security",
author = "Oliver Kosut and J{\"o}rg Kliewer",
year = "2017",
month = "7",
day = "1",
doi = "10.1109/TIT.2017.2701804",
language = "English (US)",
volume = "63",
pages = "4137--4154",
journal = "IEEE Transactions on Information Theory",
issn = "0018-9448",
publisher = "Institute of Electrical and Electronics Engineers Inc.",
number = "7",

}

TY - JOUR

T1 - Equivalence for networks with adversarial state

AU - Kosut, Oliver

AU - Kliewer, Jörg

PY - 2017/7/1

Y1 - 2017/7/1

N2 - 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.

AB - 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.

KW - Active adversary

KW - Arbitrarily-varying channel

KW - Capacity

KW - Compound channel

KW - Equivalence

KW - Network security

UR - http://www.scopus.com/inward/record.url?scp=85025710357&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=85025710357&partnerID=8YFLogxK

U2 - 10.1109/TIT.2017.2701804

DO - 10.1109/TIT.2017.2701804

M3 - Article

AN - SCOPUS:85025710357

VL - 63

SP - 4137

EP - 4154

JO - IEEE Transactions on Information Theory

JF - IEEE Transactions on Information Theory

SN - 0018-9448

IS - 7

M1 - 7920294

ER -