A Routing Algorithm for Getting Optimal Delay Variation with Delay-Bounds

摘要：

In this paper, our research is concerned with the problem of minimization of multicast delay variation under the multicast end-to-end delay constraints. At present, several heuristic algorithms were proposed, such as DVMA1 （Delay Variation Multicast Algorithm), DDVCA2 （Delay and Delay Variation Constraint Algorithm). In the third reference, the author presented an algorithm which outperforms the best-known DDVCA. On the basis of the third literature, we propose an efficient multicast routing algorithm. By altering the paths from the source node to the destinations, the node whose delay is the minimum will achieve a new delay as big as possible and the node whose delay is the maximum will achieve a new delay as small as possible, so the delay variation is decreased. It is shown that, in terms of delay variation, the heuristic algorithm is better than the algorithm in the third literature on average.

关键词： delay delay variation multicast tree DVBMT Dijkstras algorithm

作者: Chun de Yang Xiaotian Yang

作者单位: Dept.Of Mathematics and Physics ChongQing University of Posts and Communications ChongQing, China Dept.Of Computer Science and Technology ChongQing University of Posts and Communications ChongQing,

会议类型: 国际会议

会议名称: 2008 Sino-European Workshop on Intelligent Robots and Systems(SEIROS08)(第一届中欧智能系统及机器人国际学术研讨会)

会议地点: 重庆

会议语种:英文

页码: 1-5

在线出版日期: 2008-12-11（万方平台首次上网日期，不代表论文的发表时间）