On the multiple unicast network coding conjecture

Author(s)
Langberg, Michael; Medard, Muriel
Thumbnail
DownloadLangberg-2009-On the multiple unicast network coding conjecture.pdf (186.3Kb)
PUBLISHER_POLICY
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.
Metadata
Show full item record
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.
Date issued
2010-01
URI
http://hdl.handle.net/1721.1/59589
Department
Massachusetts Institute of Technology. Department of Electrical Engineering and Computer Science; Massachusetts Institute of Technology. Research Laboratory of Electronics
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
Other identifiers
INSPEC Accession Number: 11135244
ISBN
978-1-4244-5870-7
Collections