DocumentCode
2181507
Title
Approaches to Network Coding for Multiple Unicasts
Author
Ratnakar, Niranjan ; Traskov, Danail ; Koetter, Ralf
Author_Institution
Lab. of Coordinate Sci., Illinois Univ., Urbana, IL
fYear
0
fDate
0-0 0
Firstpage
70
Lastpage
73
Abstract
In this paper, we survey the application of linear network coding to a multiple unicasts scenario in directed graphs. We discuss related work concerning the complexity of the construction of capacity-achieving linear network codes. We briefly review the algebraic formulation of the problem and in the remainder of the paper, we investigate two approaches to construct network codes. One is based on state-space realizations and the other is a suboptimal, yet simpler approach based on linear optimization
Keywords
algebra; directed graphs; linear codes; telecommunication networks; algebraic formulation; directed graphs; linear network coding; linear optimization; multiple unicasts; network coding; Network coding; Routing; Seminars; Throughput; Unicast; Vectors;
fLanguage
English
Publisher
ieee
Conference_Titel
Communications, 2006 International Zurich Seminar on
Conference_Location
Zurich
Print_ISBN
1-4244-0092-9
Type
conf
DOI
10.1109/IZS.2006.1649081
Filename
1649081
Link To Document