Network Coding: Beyond Throughput Benefits

被引:11
作者
Fragouli, Christina [1 ]
机构
[1] Ecole Polytech Fed Lausanne, Sch Comp & Commun Sci, CH-1005 Lausanne, Switzerland
基金
瑞士国家科学基金会;
关键词
Communication networks; network coding; wireless network; ALGORITHMS; MULTICAST;
D O I
10.1109/JPROC.2010.2093470
中图分类号
TM [电工技术]; TN [电子技术、通信技术];
学科分类号
0808 ; 0809 ;
摘要
Network coding enables novel network functionalities and thus offers a wider canvas of choices when optimizing an information flow problem. In this paper, we examine the simplest possible information flow problem, a unicast connection, and explore what we believe is one of the most attractive features network coding offers: the ability to enable near-optimal performance in a completely decentralized and randomized setting. This is an especially attractive feature for wireless applications. However, it comes at the cost of an overhead in terms of rate that can be significant for applications that operate using relatively short frame lengths, as is the case in the wireless setting. We review the efforts in the literature to either alleviate this overhead, or alternatively, to exploit it for network management and control.
引用
收藏
页码:461 / 475
页数:15
相关论文
共 52 条
[1]  
Agarwal A, 2004, 2004 IEEE INFORMATION THEORY WORKSHOP, PROCEEDINGS, P247
[2]   Network information flow [J].
Ahlswede, R ;
Cai, N ;
Li, SYR ;
Yeung, RW .
IEEE TRANSACTIONS ON INFORMATION THEORY, 2000, 46 (04) :1204-1216
[3]  
[Anonymous], 1978, The Theory of Error-Correcting Codes
[4]  
[Anonymous], 2003, Algebraic Codes for Data Transmission
[5]  
[Anonymous], 1970, PROBLEMY PEREDACHI I
[6]  
[Anonymous], P ACM SIGCOMM WORKSH
[7]   NONBINARY BCH DECODING [J].
BERLEKAMP, ER .
IEEE TRANSACTIONS ON INFORMATION THEORY, 1968, 14 (02) :242-+
[8]   On average throughput and alphabet size in network coding [J].
Chekuri, Chandra ;
Fragouli, Christina ;
Soljanin, Emina .
IEEE TRANSACTIONS ON INFORMATION THEORY, 2006, 52 (06) :2410-2424
[9]  
CHOU PA, 2003, P AL C COMM CONTR CO
[10]  
EBRAHIMI J, 2010, P 48 ANN ALL C COMM