On the multiple unicast network coding conjecture

Michael Langberg; Muriel Médard

doi:10.1109/ALLERTON.2009.5394800

On the multiple unicast network coding conjecture

Michael Langberg, Muriel Médard

Computer Science discipline

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

Abstract

In this paper, we study the multiple unicast network communication problem on undirected graphs. It has been conjectured by Li and Li [CISS 2004] that, for the problem at hand, the use of network coding does not allow any advantage over standard routing. Loosely speaking, we show that under certain (strong) connectivity requirements the advantage of network coding is indeed bounded by 3.

Original language	English
Title of host publication	2009 47th Annual Allerton Conference on Communication, Control, and Computing, Allerton 2009
Pages	222-227
Number of pages	6
DOIs	https://doi.org/10.1109/ALLERTON.2009.5394800
State	Published - 2009
Event	2009 47th Annual Allerton Conference on Communication, Control, and Computing, Allerton 2009 - Monticello, IL, United States Duration: 30 Sep 2009 → 2 Oct 2009

Publication series

Name	2009 47th Annual Allerton Conference on Communication, Control, and Computing, Allerton 2009

Conference

Conference	2009 47th Annual Allerton Conference on Communication, Control, and Computing, Allerton 2009
Country/Territory	United States
City	Monticello, IL
Period	30/09/09 → 2/10/09

Access to Document

10.1109/ALLERTON.2009.5394800

Cite this

@inproceedings{080fe9a3108a4d73ac573efbde30ca06,

title = "On the multiple unicast network coding conjecture",

abstract = "In this paper, we study the multiple unicast network communication problem on undirected graphs. It has been conjectured by Li and Li [CISS 2004] that, for the problem at hand, the use of network coding does not allow any advantage over standard routing. Loosely speaking, we show that under certain (strong) connectivity requirements the advantage of network coding is indeed bounded by 3.",

author = "Michael Langberg and Muriel M{\'e}dard",

note = "Copyright: Copyright 2010 Elsevier B.V., All rights reserved.; 2009 47th Annual Allerton Conference on Communication, Control, and Computing, Allerton 2009 ; Conference date: 30-09-2009 Through 02-10-2009",

year = "2009",

doi = "10.1109/ALLERTON.2009.5394800",

language = "אנגלית",

isbn = "9781424458714",

series = "2009 47th Annual Allerton Conference on Communication, Control, and Computing, Allerton 2009",

pages = "222--227",

booktitle = "2009 47th Annual Allerton Conference on Communication, Control, and Computing, Allerton 2009",

}

Langberg, M & Médard, M 2009, On the multiple unicast network coding conjecture. in 2009 47th Annual Allerton Conference on Communication, Control, and Computing, Allerton 2009., 5394800, 2009 47th Annual Allerton Conference on Communication, Control, and Computing, Allerton 2009, pp. 222-227, 2009 47th Annual Allerton Conference on Communication, Control, and Computing, Allerton 2009, Monticello, IL, United States, 30/09/09. https://doi.org/10.1109/ALLERTON.2009.5394800

On the multiple unicast network coding conjecture. / Langberg, Michael; Médard, Muriel.
2009 47th Annual Allerton Conference on Communication, Control, and Computing, Allerton 2009. 2009. p. 222-227 5394800 (2009 47th Annual Allerton Conference on Communication, Control, and Computing, Allerton 2009).

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

TY - GEN

T1 - On the multiple unicast network coding conjecture

AU - Langberg, Michael

AU - Médard, Muriel

PY - 2009

Y1 - 2009

N2 - In this paper, we study the multiple unicast network communication problem on undirected graphs. It has been conjectured by Li and Li [CISS 2004] that, for the problem at hand, the use of network coding does not allow any advantage over standard routing. Loosely speaking, we show that under certain (strong) connectivity requirements the advantage of network coding is indeed bounded by 3.

AB - In this paper, we study the multiple unicast network communication problem on undirected graphs. It has been conjectured by Li and Li [CISS 2004] that, for the problem at hand, the use of network coding does not allow any advantage over standard routing. Loosely speaking, we show that under certain (strong) connectivity requirements the advantage of network coding is indeed bounded by 3.

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

U2 - 10.1109/ALLERTON.2009.5394800

DO - 10.1109/ALLERTON.2009.5394800

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

AN - SCOPUS:77949642181

SN - 9781424458714

T3 - 2009 47th Annual Allerton Conference on Communication, Control, and Computing, Allerton 2009

SP - 222

EP - 227

BT - 2009 47th Annual Allerton Conference on Communication, Control, and Computing, Allerton 2009

T2 - 2009 47th Annual Allerton Conference on Communication, Control, and Computing, Allerton 2009

Y2 - 30 September 2009 through 2 October 2009

ER -

On the multiple unicast network coding conjecture

Abstract

Publication series

Conference

Access to Document

Other files and links

Fingerprint

Cite this