On the multiple unicast network coding conjecture
Name
Langberg-2009-On the multiple unicast network coding conjecture.pdf
Size
186.3 KB
Format
Adobe PDF
Checksum (MD5)
1b51a58d3447a679d3a2008b49dd4015
Author(s)
Langberg, Michael
Medard, Muriel
Date Issued
January 2010
Journal
47th Annual Allerton Conference on Communication, Control, and Computing, 2009. Allerton 2009
Publisher
Institute of Electrical and Electronics Engineers
Citation
Langberg, M., and M. Medard. “On the multiple unicast network coding, conjecture.” Communication, Control, and Computing, 2009. Allerton 2009. 47th Annual Allerton Conference on. 2009. 222-227. ©2010 Institute of Electrical and Electronics Engineers.
Version
Final published version
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.
MIT Department
Massachusetts Institute of Technology. Department of Electrical Engineering and Computer Science
Massachusetts Institute of Technology. Research Laboratory of Electronics
Terms of Use
Article is made available in accordance with the publisher's policy and may be subject to US copyright law. Please refer to the publisher's site for terms of use.
Persistent DSpace Link
DOI of Published Version
https://doi.org/10.1109/ALLERTON.2009.5394800
