基于共享边的时延约束组播路由算法

Delay-constrained multicast routing algorithm based on shared edges

为了优化在时延约束下的组播树代价,降低算法计算复杂度,研究了时延受限的Steiner树问题。分析了最短路径启发式(MPH)算法的执行过程,以此为基础提出一个基于共享边的时延约束组播路由算法ESAMPH。该算法在构建组播路由树时能够优先采用包含有较多的最短路径经过的节点,这样后面的组播成员节点到树上的最短路径也有可能经过这些节点,由此实现边的共享,降低了组播树的代价。仿真结果表明,ESAMPH算法在代价、延迟和计算时间之间能获得较好的平衡,综合性能较好。

In order to optimize cost and decrease time complexity, the delay-constrained Steiner tree problem was discussed. The implementation of Minimum Path Heuristic （MPH） algorithm was analyzed firstly, then a delay-constrained muhicast routing algorithm based on shared edges named ESAMPH was presented. ESAMPH preferentially selected the nodes through which more shortest path was contained when constructing a multicast routing tree, therefore, the next node to the multicast tree may be also the shortest path through these nodes to reduce the cost of multicast tree. Simulation results show that ESAMPH balances cost, delay and computing time and has better overall performance.