%0 Journal Article
%T Delay-constrained minimum cost multicast tree algorithm<br>时延受限费用最小多播树算法
%A YANG Chun-de
%A REN Jing-jing
%A <br>杨春德
%A 任静静
%J 计算机应用
%D 2009
%I 
%X Based on the Random Selective Tree Node First (RSTF) algorithm that constructs minimum cost multicast tree and considering the delay of the network, this paper presented a new algorithm constructing delay-constrained minimum cost multicast tree. The simulation about random network model shows that compared with KPP the new algorithm has better performance in terms of cost and time delay.
%K delay-constrained
%K the minimum cost multicast tree
%K random network<br>时延受限
%K 费用最小多播树
%K 随机网络
%U http://www.alljournals.cn/get_abstract_url.aspx?pcid=5B3AB970F71A803DEACDC0559115BFCF0A068CD97DD29835&cid=8240383F08CE46C8B05036380D75B607&jid=831E194C147C78FAAFCC50BC7ADD1732&aid=8471996DEE7B53BC0083B432413EED45&yid=DE12191FBD62783C&vid=771469D9D58C34FF&iid=CA4FD0336C81A37A&sid=C5154311167311FE&eid=DB817633AA4F79B9&journal_id=1001-9081&journal_name=计算机应用&referenced_num=0&reference_num=12