A scalable low-overhead rate control algorithm for multirate multicast sessions

被引:50
作者
Kar, K [1 ]
Sarkar, S
Tassiulas, AL
机构
[1] Univ Maryland, Dept Elect & Comp Engn, College Pk, MD 20742 USA
[2] Univ Penn, Dept Elect Engn, Philadelphia, PA 19104 USA
关键词
flow control; layered multicast; multirate multicast; optimization;
D O I
10.1109/JSAC.2002.803988
中图分类号
TM [电工技术]; TN [电子技术、通信技术];
学科分类号
0808 ; 0809 ;
摘要
In multirate multicasting, different users (receivers) within the same multicast group can receive service at different rates, depending on the user requirements and the network congestion level. Compared with unirate multicasting, this provides more flexibility to the user and allows more efficient usage of the network resources. In this paper, we address the rate control problem for multirate multicast sessions, with the objective of maximizing the total receiver utility. This aggregate utility maximization problem not only takes into account the heterogeneity in user requirements, but also provides a unified framework for diverse fairness objectives. We propose an algorithm for this problem and show, through analysis and simulation, that it converges to the optimal rates. In spite of the nonseparability of the problem, the solution that we develop is completely decentralized, scalable and does not require the network to know the receiver utilities. The algorithm requires very simple computations both for the user and the network, and also has very low overhead of network congestion feedback.
引用
收藏
页码:1541 / 1557
页数:17
相关论文
共 27 条
[1]  
ATHURALIYA S, 2000, P 1 INT WORKSH QUAL
[2]  
Bertsekas D. P., 1992, DATA NETWORKS
[3]  
Bertsekas Dimitri P., 1989, PARALLEL DISTRIBUTED
[4]   NECESSARY AND SUFFICIENT CONDITIONS FOR A PENALTY METHOD TO BE EXACT [J].
BERTSEKAS, DP .
MATHEMATICAL PROGRAMMING, 1975, 9 (01) :87-99
[5]  
BERTSEKAS DP, 1995, NONLINEAR PROGRAMMIN
[6]   A TECHNIQUE FOR ADAPTIVE VOICE FLOW-CONTROL IN INTEGRATED PACKET NETWORKS [J].
BIALLY, T ;
GOLD, B ;
SENEFF, S .
IEEE TRANSACTIONS ON COMMUNICATIONS, 1980, 28 (03) :325-333
[7]  
DEB S, 2001, P C DEC CONTR 2001 O
[8]  
GRAVES E, 2001, P TYRRH INT WORKSH D
[9]  
KAR K, 2001, P INFOCOM 2001 ANCH
[10]  
KAR K, 2000, 200052 ISR TR