Network equivalence for a joint compound-arbitrarily-varying network model

Oliver Kosut, Jorg Kliewer

Research output: Chapter in Book/Report/Conference proceedingConference contribution

1 Citation (Scopus)

Abstract

We consider the problem of finding the capacity of noisy networks under the presence of Byzantine adversaries, modeled by a joint compound channel and arbitrarily varying channel (AVC) model. This extends our earlier work which considers these models only in isolation. The motivation for this setup is that typically the adversary first selects an arbitrary subset of edges from the network and then specifies adversarial transmissions to each of the selected edges. We show that in some cases equivalence between this network and another network holds in the sense that for a fixed selection of adversarial edges the noisy links can be replaced by noiseless bit-pipes with a capacity equal to the random coding capacity of the corresponding AVC. In particular, the capacity region for the noisy network can be outer bounded by the intersection of the individual capacity regions for the noiseless case, for each adversarial edge selection. Moreover, if the network is fully connected, we also show that this upper bound is equivalent to the capacity of the noisy network. We also provide necessary and sufficient condition for full connectivity, making use of a new condition for an AVC termed overwritability.

Original languageEnglish (US)
Title of host publication2016 IEEE Information Theory Workshop, ITW 2016
PublisherInstitute of Electrical and Electronics Engineers Inc.
Pages141-145
Number of pages5
ISBN (Electronic)9781509010905
DOIs
StatePublished - Oct 21 2016
Event2016 IEEE Information Theory Workshop, ITW 2016 - Cambridge, United Kingdom
Duration: Sep 11 2016Sep 14 2016

Other

Other2016 IEEE Information Theory Workshop, ITW 2016
CountryUnited Kingdom
CityCambridge
Period9/11/169/14/16

Fingerprint

Pipe

ASJC Scopus subject areas

  • Computer Networks and Communications
  • Information Systems
  • Software
  • Signal Processing

Cite this

Kosut, O., & Kliewer, J. (2016). Network equivalence for a joint compound-arbitrarily-varying network model. In 2016 IEEE Information Theory Workshop, ITW 2016 (pp. 141-145). [7606812] Institute of Electrical and Electronics Engineers Inc.. https://doi.org/10.1109/ITW.2016.7606812

Network equivalence for a joint compound-arbitrarily-varying network model. / Kosut, Oliver; Kliewer, Jorg.

2016 IEEE Information Theory Workshop, ITW 2016. Institute of Electrical and Electronics Engineers Inc., 2016. p. 141-145 7606812.

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Kosut, O & Kliewer, J 2016, Network equivalence for a joint compound-arbitrarily-varying network model. in 2016 IEEE Information Theory Workshop, ITW 2016., 7606812, Institute of Electrical and Electronics Engineers Inc., pp. 141-145, 2016 IEEE Information Theory Workshop, ITW 2016, Cambridge, United Kingdom, 9/11/16. https://doi.org/10.1109/ITW.2016.7606812
Kosut O, Kliewer J. Network equivalence for a joint compound-arbitrarily-varying network model. In 2016 IEEE Information Theory Workshop, ITW 2016. Institute of Electrical and Electronics Engineers Inc. 2016. p. 141-145. 7606812 https://doi.org/10.1109/ITW.2016.7606812
Kosut, Oliver ; Kliewer, Jorg. / Network equivalence for a joint compound-arbitrarily-varying network model. 2016 IEEE Information Theory Workshop, ITW 2016. Institute of Electrical and Electronics Engineers Inc., 2016. pp. 141-145
@inproceedings{4b2653fd22c0419e9dd5fcde3ff83dc3,
title = "Network equivalence for a joint compound-arbitrarily-varying network model",
abstract = "We consider the problem of finding the capacity of noisy networks under the presence of Byzantine adversaries, modeled by a joint compound channel and arbitrarily varying channel (AVC) model. This extends our earlier work which considers these models only in isolation. The motivation for this setup is that typically the adversary first selects an arbitrary subset of edges from the network and then specifies adversarial transmissions to each of the selected edges. We show that in some cases equivalence between this network and another network holds in the sense that for a fixed selection of adversarial edges the noisy links can be replaced by noiseless bit-pipes with a capacity equal to the random coding capacity of the corresponding AVC. In particular, the capacity region for the noisy network can be outer bounded by the intersection of the individual capacity regions for the noiseless case, for each adversarial edge selection. Moreover, if the network is fully connected, we also show that this upper bound is equivalent to the capacity of the noisy network. We also provide necessary and sufficient condition for full connectivity, making use of a new condition for an AVC termed overwritability.",
author = "Oliver Kosut and Jorg Kliewer",
year = "2016",
month = "10",
day = "21",
doi = "10.1109/ITW.2016.7606812",
language = "English (US)",
pages = "141--145",
booktitle = "2016 IEEE Information Theory Workshop, ITW 2016",
publisher = "Institute of Electrical and Electronics Engineers Inc.",
address = "United States",

}

TY - GEN

T1 - Network equivalence for a joint compound-arbitrarily-varying network model

AU - Kosut, Oliver

AU - Kliewer, Jorg

PY - 2016/10/21

Y1 - 2016/10/21

N2 - We consider the problem of finding the capacity of noisy networks under the presence of Byzantine adversaries, modeled by a joint compound channel and arbitrarily varying channel (AVC) model. This extends our earlier work which considers these models only in isolation. The motivation for this setup is that typically the adversary first selects an arbitrary subset of edges from the network and then specifies adversarial transmissions to each of the selected edges. We show that in some cases equivalence between this network and another network holds in the sense that for a fixed selection of adversarial edges the noisy links can be replaced by noiseless bit-pipes with a capacity equal to the random coding capacity of the corresponding AVC. In particular, the capacity region for the noisy network can be outer bounded by the intersection of the individual capacity regions for the noiseless case, for each adversarial edge selection. Moreover, if the network is fully connected, we also show that this upper bound is equivalent to the capacity of the noisy network. We also provide necessary and sufficient condition for full connectivity, making use of a new condition for an AVC termed overwritability.

AB - We consider the problem of finding the capacity of noisy networks under the presence of Byzantine adversaries, modeled by a joint compound channel and arbitrarily varying channel (AVC) model. This extends our earlier work which considers these models only in isolation. The motivation for this setup is that typically the adversary first selects an arbitrary subset of edges from the network and then specifies adversarial transmissions to each of the selected edges. We show that in some cases equivalence between this network and another network holds in the sense that for a fixed selection of adversarial edges the noisy links can be replaced by noiseless bit-pipes with a capacity equal to the random coding capacity of the corresponding AVC. In particular, the capacity region for the noisy network can be outer bounded by the intersection of the individual capacity regions for the noiseless case, for each adversarial edge selection. Moreover, if the network is fully connected, we also show that this upper bound is equivalent to the capacity of the noisy network. We also provide necessary and sufficient condition for full connectivity, making use of a new condition for an AVC termed overwritability.

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

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

U2 - 10.1109/ITW.2016.7606812

DO - 10.1109/ITW.2016.7606812

M3 - Conference contribution

SP - 141

EP - 145

BT - 2016 IEEE Information Theory Workshop, ITW 2016

PB - Institute of Electrical and Electronics Engineers Inc.

ER -