Optimization based rate control for multicast with network coding

被引:49
作者
Chen, Lijun [1 ]
Ho, Tracey [1 ]
Low, Steven H. [1 ]
Chiang, Mung [2 ]
Doyle, John C. [1 ]
机构
[1] CALTECH, Div Engn & Appl Sci, Pasadena, CA 91125 USA
[2] Princeton Univ, Dept Elect Engn, Princeton, NJ 08544 USA
来源
INFOCOM 2007, VOLS 1-5 | 2007年
关键词
rate control; network coding; multicast; coding subgraph; distributed algorithm;
D O I
10.1109/INFCOM.2007.139
中图分类号
TM [电工技术]; TN [电子技术、通信技术];
学科分类号
0808 ; 0809 ;
摘要
Recent advances in network coding have shown great potential for efficient information multicasting in communication networks, in terms of both network throughput and network management. In this paper, we address the problem of rate control at end-systems for network coding based multicast flows. We develop two adaptive rate control algorithms for the networks with given coding subgraphs and without given coding subgraphs, respectively. With random network coding, both algorithms can be implemented in a distributed manner, and work at transport layer to adjust source rates and at network layer to carry out network coding. We prove that the proposed algorithms converge to the globally optimal solutions for intra-session network coding. Some related issues are discussed, and numerical examples are provided to complement our theoretical analysis.
引用
收藏
页码:1163 / +
页数:2
相关论文
共 31 条
[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 ALL C COMM CONTR C
[3]  
[Anonymous], P IEEE INFOCOM
[4]  
[Anonymous], 2003, 51 ALL C COMM CONTR
[5]  
Bertsekas D., 1999, NONLINEAR PROGRAMMIN
[6]  
DANA AF, 2006, IEEE T INFORM THEORY
[7]  
DEB S, 2001, P CDC
[8]   MINIMUM DELAY ROUTING ALGORITHM USING DISTRIBUTED COMPUTATION [J].
GALLAGER, RG .
IEEE TRANSACTIONS ON COMMUNICATIONS, 1977, 25 (01) :73-85
[9]   An information-theoretic view of network management [J].
Ho, T ;
Médard, M ;
Koetter, R .
IEEE TRANSACTIONS ON INFORMATION THEORY, 2005, 51 (04) :1295-1312
[10]  
HO T, 2005, P ALL C COMM CONTR C