Resource allocation in a multicast tree

被引:8
作者
Kodialam, M [1 ]
Low, SH [1 ]
机构
[1] Lucent Technol, Bell Labs, Holmdel, NJ 07733 USA
来源
IEEE INFOCOM '99 - THE CONFERENCE ON COMPUTER COMMUNICATIONS, VOLS 1-3, PROCEEDINGS: THE FUTURE IS NOW | 1999年
关键词
multicast; resource allocation; convex optimization; flow control;
D O I
10.1109/INFCOM.1999.749291
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
We consider how to allocate bandwidth in a multicast tree so as to optimize some global measure of performance. In our model each receiver has a budget to be used for bandwidth reservation on links along its path from the source, and each link has a cost function depending on the amount of total bandwidth reserved at the link by all receivers using that link. We formulate and solve a problem of allocating bandwidth in the multicast tree such that the sum of link costs is minimized.
引用
收藏
页码:262 / 266
页数:5
相关论文
共 7 条
[1]  
Bertsekas Dimitri P., 1989, PARALLEL DISTRIBUTED
[2]   Multipoint communication: A survey of protocols, functions, and mechanisms [J].
Diot, C ;
Dabbous, W ;
Crowcroft, J .
IEEE JOURNAL ON SELECTED AREAS IN COMMUNICATIONS, 1997, 15 (03) :277-290
[3]  
FIROIU V, 1996, IEEE P INFOCOM 96 AP
[4]  
Fujishige S., 1991, SUBMODULAR FUNCTIONS
[5]  
TOPOLCIC C, 1990, 1190 RFC
[6]  
Zhang L., 1993, IEEE Network, V7, P8, DOI 10.1109/65.238150
[7]   SIMPLE RANKING METHODS FOR ALLOCATION OF ONE RESOURCE [J].
ZIPKIN, PH .
MANAGEMENT SCIENCE, 1980, 26 (01) :34-43