Single-source/sink network error correction is as hard as multiple-unicast

Wentao Huang; Tracey Ho; Michael Langberg; Joerg Kliewer

doi:10.1109/ALLERTON.2014.7028486

Single-source/sink network error correction is as hard as multiple-unicast

Wentao Huang, Tracey Ho, Michael Langberg, Joerg Kliewer

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

Abstract

We study the problem of communicating over a single-source single-terminal network in the presence of an adversary that may jam a single link of the network. If any one of the edges can be jammed, the capacity of such networks is well understood and follows directly from the connection between the minimum cut and maximum flow in single-source singleterminal networks. In this work we consider networks in which some edges cannot be jammed, and show that determining the network communication capacity is at least as hard as solving the multiple-unicast network coding problem for the error-free case. The latter problem is a long standing open problem.

Original language	English
Title of host publication	2014 52nd Annual Allerton Conference on Communication, Control, and Computing, Allerton 2014
Publisher	Institute of Electrical and Electronics Engineers Inc.
Pages	423-430
Number of pages	8
ISBN (Electronic)	9781479980093
DOIs	https://doi.org/10.1109/ALLERTON.2014.7028486
State	Published - 30 Jan 2014
Externally published	Yes
Event	2014 52nd Annual Allerton Conference on Communication, Control, and Computing, Allerton 2014 - Monticello, United States Duration: 30 Sep 2014 → 3 Oct 2014

Publication series

Name	2014 52nd Annual Allerton Conference on Communication, Control, and Computing, Allerton 2014

Conference

Conference	2014 52nd Annual Allerton Conference on Communication, Control, and Computing, Allerton 2014
Country/Territory	United States
City	Monticello
Period	30/09/14 → 3/10/14

Bibliographical note

Publisher Copyright:
© 2014 IEEE.

Access to Document

10.1109/ALLERTON.2014.7028486

Cite this

Huang, W., Ho, T., Langberg, M., & Kliewer, J. (2014). Single-source/sink network error correction is as hard as multiple-unicast. In 2014 52nd Annual Allerton Conference on Communication, Control, and Computing, Allerton 2014 (pp. 423-430). Article 7028486 (2014 52nd Annual Allerton Conference on Communication, Control, and Computing, Allerton 2014). Institute of Electrical and Electronics Engineers Inc.. https://doi.org/10.1109/ALLERTON.2014.7028486

Huang, Wentao ; Ho, Tracey ; Langberg, Michael et al. / Single-source/sink network error correction is as hard as multiple-unicast. 2014 52nd Annual Allerton Conference on Communication, Control, and Computing, Allerton 2014. Institute of Electrical and Electronics Engineers Inc., 2014. pp. 423-430 (2014 52nd Annual Allerton Conference on Communication, Control, and Computing, Allerton 2014).

@inproceedings{59add501e4ed453dab317a91a7932a17,

title = "Single-source/sink network error correction is as hard as multiple-unicast",

abstract = "We study the problem of communicating over a single-source single-terminal network in the presence of an adversary that may jam a single link of the network. If any one of the edges can be jammed, the capacity of such networks is well understood and follows directly from the connection between the minimum cut and maximum flow in single-source singleterminal networks. In this work we consider networks in which some edges cannot be jammed, and show that determining the network communication capacity is at least as hard as solving the multiple-unicast network coding problem for the error-free case. The latter problem is a long standing open problem.",

author = "Wentao Huang and Tracey Ho and Michael Langberg and Joerg Kliewer",

note = "Publisher Copyright: {\textcopyright} 2014 IEEE.; 2014 52nd Annual Allerton Conference on Communication, Control, and Computing, Allerton 2014 ; Conference date: 30-09-2014 Through 03-10-2014",

year = "2014",

month = jan,

day = "30",

doi = "10.1109/ALLERTON.2014.7028486",

language = "אנגלית",

series = "2014 52nd Annual Allerton Conference on Communication, Control, and Computing, Allerton 2014",

publisher = "Institute of Electrical and Electronics Engineers Inc.",

pages = "423--430",

booktitle = "2014 52nd Annual Allerton Conference on Communication, Control, and Computing, Allerton 2014",

address = "ארצות הברית",

}

Huang, W, Ho, T, Langberg, M & Kliewer, J 2014, Single-source/sink network error correction is as hard as multiple-unicast. in 2014 52nd Annual Allerton Conference on Communication, Control, and Computing, Allerton 2014., 7028486, 2014 52nd Annual Allerton Conference on Communication, Control, and Computing, Allerton 2014, Institute of Electrical and Electronics Engineers Inc., pp. 423-430, 2014 52nd Annual Allerton Conference on Communication, Control, and Computing, Allerton 2014, Monticello, United States, 30/09/14. https://doi.org/10.1109/ALLERTON.2014.7028486

Single-source/sink network error correction is as hard as multiple-unicast. / Huang, Wentao; Ho, Tracey; Langberg, Michael et al.
2014 52nd Annual Allerton Conference on Communication, Control, and Computing, Allerton 2014. Institute of Electrical and Electronics Engineers Inc., 2014. p. 423-430 7028486 (2014 52nd Annual Allerton Conference on Communication, Control, and Computing, Allerton 2014).

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

TY - GEN

T1 - Single-source/sink network error correction is as hard as multiple-unicast

AU - Huang, Wentao

AU - Ho, Tracey

AU - Langberg, Michael

AU - Kliewer, Joerg

PY - 2014/1/30

Y1 - 2014/1/30

N2 - We study the problem of communicating over a single-source single-terminal network in the presence of an adversary that may jam a single link of the network. If any one of the edges can be jammed, the capacity of such networks is well understood and follows directly from the connection between the minimum cut and maximum flow in single-source singleterminal networks. In this work we consider networks in which some edges cannot be jammed, and show that determining the network communication capacity is at least as hard as solving the multiple-unicast network coding problem for the error-free case. The latter problem is a long standing open problem.

AB - We study the problem of communicating over a single-source single-terminal network in the presence of an adversary that may jam a single link of the network. If any one of the edges can be jammed, the capacity of such networks is well understood and follows directly from the connection between the minimum cut and maximum flow in single-source singleterminal networks. In this work we consider networks in which some edges cannot be jammed, and show that determining the network communication capacity is at least as hard as solving the multiple-unicast network coding problem for the error-free case. The latter problem is a long standing open problem.

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

U2 - 10.1109/ALLERTON.2014.7028486

DO - 10.1109/ALLERTON.2014.7028486

M3 - ???researchoutput.researchoutputtypes.contributiontobookanthology.conference???

AN - SCOPUS:84946686697

T3 - 2014 52nd Annual Allerton Conference on Communication, Control, and Computing, Allerton 2014

SP - 423

EP - 430

BT - 2014 52nd Annual Allerton Conference on Communication, Control, and Computing, Allerton 2014

PB - Institute of Electrical and Electronics Engineers Inc.

T2 - 2014 52nd Annual Allerton Conference on Communication, Control, and Computing, Allerton 2014

Y2 - 30 September 2014 through 3 October 2014

ER -

Huang W, Ho T, Langberg M, Kliewer J. Single-source/sink network error correction is as hard as multiple-unicast. In 2014 52nd Annual Allerton Conference on Communication, Control, and Computing, Allerton 2014. Institute of Electrical and Electronics Engineers Inc. 2014. p. 423-430. 7028486. (2014 52nd Annual Allerton Conference on Communication, Control, and Computing, Allerton 2014). doi: 10.1109/ALLERTON.2014.7028486

Single-source/sink network error correction is as hard as multiple-unicast

Abstract

Publication series

Conference

Bibliographical note

Access to Document

Other files and links

Fingerprint

Cite this