%0 Journal Article
%T Improved algorithm of DVBMT problem<br>DVBMT问题的一种改进算法
%A YANG Chun-de
%A YANG Xiao-tianb
%A <br>杨春德
%A 杨孝田b
%J 计算机应用研究
%D 2009
%I 
%X This research was concerned with the problem of minimization of multicast delay variation under the multicast end-to-end delay constraints. At present, this paper proposed several heuristic algorithms, such as DVMA( delay variation multicast algorithm), DDVCA( delay and delay variation constraint algorithm). In the third reference, presented an algorithm which outperforms the best-known DDVCA. On the basis of the third literature, presented an efficient multicast routing algorithm. It is shown that, in terms of delay variation, the heuristic algorithm is better than the algorithm in the third literature on average.
%K delay
%K delay variation(delay and delay variation bounded multicast tree)
%K multicast tree
%K DVBMT
%K Floyd algorithm<br>时延
%K 时延抖动
%K 多播树
%K 时延和时延有界的多播树
%K 弗洛伊德算法
%U http://www.alljournals.cn/get_abstract_url.aspx?pcid=5B3AB970F71A803DEACDC0559115BFCF0A068CD97DD29835&cid=8240383F08CE46C8B05036380D75B607&jid=A9D9BE08CDC44144BE8B5685705D3AED&aid=9040CFBEA8996877336BACE829BA55F7&yid=DE12191FBD62783C&vid=96C778EE049EE47D&iid=38B194292C032A66&sid=A326383D2F3B3AB0&eid=D7C79E0E439D0B57&journal_id=1001-3695&journal_name=计算机应用研究&referenced_num=2&reference_num=7