Network Coding of Rateless Video in Streaming Overlays

被引:20
作者
Thomos, Nikolaos [1 ]
Frossard, Pascal [1 ]
机构
[1] Swiss Fed Inst Technol, Signal Proc Lab, CH-1015 Lausanne, Switzerland
基金
瑞士国家科学基金会;
关键词
Network coding; optimization; overlay networks; p2p streaming; Raptor codes; rate allocation; MULTICAST; DELIVERY; INTERNET; FEC;
D O I
10.1109/TCSVT.2010.2087830
中图分类号
TM [电工技术]; TN [电子技术、通信技术];
学科分类号
0808 ; 0809 ;
摘要
We present a system for collaborative video streaming in wired overlay networks. We propose a scheme that builds on both rateless codes and network coding in order to improve the system throughput and the video quality at clients. Our hybrid coding algorithm permits to efficiently exploit the available source and path diversity without the need for expensive routing nor scheduling algorithms. We consider specifically an architecture where multiple streaming servers simultaneously deliver video information to a set of clients. The servers apply Raptor coding on the video packets for error resiliency, and the overlay nodes selectively combine the Raptor coded video packets in order to increase the packet diversity in the system. We analyze the performance of selective network coding and describe its application to practical video streaming systems. We further compute an effective source and channel rate allocation in our collaborative streaming system. We estimate the expected symbol diversity at clients with respect to the coding choices. Then we cast a minmax quality optimization problem that is solved by a low-cost bisection based method. The experimental evaluation demonstrates that our system typically outperforms Raptor video streaming systems that do not use network coding as well as systems that perform decoding and encoding in the network nodes. Finally, our solution has a low complexity and only requires small buffers in the network coding nodes, which are certainly two important advantages toward deployment in practical streaming systems.
引用
收藏
页码:1834 / 1847
页数:14
相关论文
共 42 条
[1]   Network information flow [J].
Ahlswede, R ;
Cai, N ;
Li, SYR ;
Yeung, RW .
IEEE TRANSACTIONS ON INFORMATION THEORY, 2000, 46 (04) :1204-1216
[2]  
[Anonymous], P IEEE INFOCOM MAR
[3]  
[Anonymous], P 41 ALL ANN C COMM
[4]  
[Anonymous], JVT REFERENCE SOFTWA
[5]  
[Anonymous], P VIS COMM IM PROC J
[6]  
[Anonymous], LTSREPORT2009011 EPF
[7]  
[Anonymous], J DISTRIBUTED COMPUT
[8]  
[Anonymous], P IEEE ISIT JUL
[9]  
[Anonymous], P 3 IEEE CCNC JAN
[10]  
[Anonymous], 2005, 26346 3GPP TS