How practical is network coding?

被引:62
作者
Wang, Mea [1 ]
Li, Baochun [1 ]
机构
[1] Univ Toronto, Dept Elect & Comp Engn, Toronto, ON, Canada
来源
2006 14TH IEEE INTERNATIONAL WORKSHOP ON QUALITY OF SERVICE, PROCEEDINGS | 2006年
关键词
D O I
10.1109/IWQOS.2006.250480
中图分类号
TN [电子技术、通信技术];
学科分类号
0809 ;
摘要
With network coding, intermediate nodes between the source and the receivers of an end-to-end communication session are not only capable of relaying and replicating data messages, but also of coding incoming messages to produce coded outgoing ones. Recent studies have shown that network coding is beneficial for peer-to-peer content distribution, since it eliminates the need for content reconciliation, and is highly resilient to peer failures. In this paper, we present our recent experiences with a highly optimized and high-performance C++ implementation of randomized network coding at the application layer. We present our observations based on an extensive series of experiments, draw conclusions from a Wide range of scenarios, and are more cautious and less optimistic as compared to previous studies.
引用
收藏
页码:274 / +
页数:2
相关论文
共 7 条
  • [1] Network information flow
    Ahlswede, R
    Cai, N
    Li, SYR
    Yeung, RW
    [J]. IEEE TRANSACTIONS ON INFORMATION THEORY, 2000, 46 (04) : 1204 - 1216
  • [2] [Anonymous], 2003, 51 ALL C COMM CONTR
  • [3] Gkantsidis C., 2006, P 5 INT WORKSH PEER
  • [4] GKANTSIDIS C, 2005, P IEEE INFOCOM 2005
  • [5] HO T, 2003, P INT S INF THEOR IS
  • [6] HO T, 2003, P ALL C COMM CONTR C
  • [7] An algebraic approach to network coding
    Koetter, R
    Médard, M
    [J]. IEEE-ACM TRANSACTIONS ON NETWORKING, 2003, 11 (05) : 782 - 795