DocumentCode
3235934
Title
On the multiple unicast network coding, conjecture
Author
Langberg, Michael ; Médard, Muriel
Author_Institution
Comput. Sci. Div., Open Univ. of Israel, Raanana, Israel
fYear
2009
fDate
Sept. 30 2009-Oct. 2 2009
Firstpage
222
Lastpage
227
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.
Keywords
directed graphs; multicast communication; network coding; telecommunication network routing; multiple unicast network communication; network coding; routing; undirected graphs; Bipartite graph; Broadcasting; Computer science; Encoding; Laboratories; Network coding; Polynomials; Routing; Unicast;
fLanguage
English
Publisher
ieee
Conference_Titel
Communication, Control, and Computing, 2009. Allerton 2009. 47th Annual Allerton Conference on
Conference_Location
Monticello, IL
Print_ISBN
978-1-4244-5870-7
Type
conf
DOI
10.1109/ALLERTON.2009.5394800
Filename
5394800
Link To Document