Network coding for the Internet and wireless networks

被引:139
作者
Chou, Philip A. [1 ]
Wu, Yunnan
机构
[1] Microsoft Corp, Redmond, WA 98052 USA
[2] Univ Washington, Seattle, WA 98195 USA
[3] Chinese Univ Hong Kong, Sha Tin 100083, Peoples R China
关键词
D O I
10.1109/MSP.2007.904818
中图分类号
TM [电工技术]; TN [电子技术、通信技术];
学科分类号
0808 ; 0809 ;
摘要
Network coding is a promising routing generalization as it allows each node in a network to do some computation. Specifically, it is the transmission, encoding and reencoding of sent messages arriving at nodes inside the network, such that the transmitted messages can be decoded at their final destinations. In contrast to routing, network coding can improve throughput by pushing streams of information through the bottleneck link at the same time. The two streams are mixed together by taking their exclusive-OR bit-by-bit and sending the mixed stream through the link using network coding. In addition, network coding reduces the amount of energy required per packet of information multicast in a wireless network, not to mention the amount of delay as measured by the maximum number of hops for a packet to reach a receiver, for instance. The practicality of network coding relies on the concept of random coding, packet tagging and buffering. However, adopting network coding given the current capability of the Internet is still unlikely, as there is still a need to keep computation and per-flow state out of the core, a need for backward compatibility with a massive deployed base and a need for multipath routing to make network coding effective.
引用
收藏
页码:77 / 85
页数:9
相关论文
共 30 条
[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 1 WORKSH NETW COD
[3]  
[Anonymous], P 41 ALL C COMM CONT
[4]  
[Anonymous], 2004, MSRTR200478
[5]  
CHOU PA, 2007, MSRTR200770
[6]  
Cohen B, 2003, P 1 WORKSH EC PEER T
[7]  
DIMAKIS AG, 2007, P INFOCOM ANCH AL
[8]  
Dimakis Alexandros G, 2006, IEEE T INFORM THEORY
[9]  
Edmonds Jack, 1973, Combinatorial Algorithms, P91
[10]   A NOTE ON THE MAXIMUM FLOW THROUGH A NETWORK [J].
ELIAS, P ;
FEINSTEIN, A ;
SHANNON, CE .
IRE TRANSACTIONS ON INFORMATION THEORY, 1956, 2 (04) :117-119