计算机工程与应用 ›› 2011, Vol. 47 ›› Issue (3): 84-86.DOI: 10.3778/j.issn.1002-8331.2011.03.025
• 网络、通信、安全 • 上一篇 下一篇
杨春德1,邓 超2
收稿日期:
修回日期:
出版日期:
发布日期:
通讯作者:
YANG Chunde1,DENG Chao2
Received:
Revised:
Online:
Published:
Contact:
摘要: 对E-DVMA所研究的多播端到端时延受限条件下的最优时延抖动问题进行了改进。在不增大时延抖动的基础上,有效地降低了平均时延。仿真结果表明,该算法的平均时延小于E-DVMA的平均时延。
关键词: 弗洛伊德算法, 平均时延, 多播树, 时延和时延有界的多播树
Abstract: This paper is concerned with the average delay of the problem of minimization of multicast delay variation under the multicast end-to-end delay constraints.On the basis of the E-DVMA(Extend-Delay Variation Multicast Algorithm),an efficient multicast routing algorithm is presented.It is shown that,in terms of delay,the heuristic algorithm is better than the algorithm in the E-DVMA on average.
Key words: Floyd algorithm, average delay, multicast tree, Delay and Delay Variation Bounded Multicast Tree(DVBMT)
中图分类号:
TP393
杨春德1,邓 超2. DVBMT问题的改进算法[J]. 计算机工程与应用, 2011, 47(3): 84-86.
YANG Chunde1,DENG Chao2. Improved algorithm of DVBMT problem[J]. Computer Engineering and Applications, 2011, 47(3): 84-86.
0 / 推荐
导出引用管理器 EndNote|Ris|BibTeX
链接本文: http://cea.ceaj.org/CN/10.3778/j.issn.1002-8331.2011.03.025
http://cea.ceaj.org/CN/Y2011/V47/I3/84