Computer Engineering and Applications ›› 2011, Vol. 47 ›› Issue (3): 84-86.DOI: 10.3778/j.issn.1002-8331.2011.03.025

• 网络、通信、安全 • Previous Articles     Next Articles

Improved algorithm of DVBMT problem

YANG Chunde1,DENG Chao2   

  1. 1.College of Mathematics and Physics,Chongqing University of Posts and Communications,Chongqing 400065,China
    2.College of Computer Science and Technology,Chongqing University of Posts and Communications,Chongqing 400065,China
  • Received:2009-05-07 Revised:2009-07-13 Online:2011-01-21 Published:2011-01-21
  • Contact: YANG Chunde

DVBMT问题的改进算法

杨春德1,邓 超2   

  1. 1.重庆邮电大学 数理学院,重庆 400065
    2.重庆邮电大学 计算机科学与技术学院,重庆 400065
  • 通讯作者: 杨春德

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)

摘要: 对E-DVMA所研究的多播端到端时延受限条件下的最优时延抖动问题进行了改进。在不增大时延抖动的基础上,有效地降低了平均时延。仿真结果表明,该算法的平均时延小于E-DVMA的平均时延。

关键词: 弗洛伊德算法, 平均时延, 多播树, 时延和时延有界的多播树

CLC Number: