摘要
提出了一种新的服务质量保证的组播路由算法。算法使用了一个修改的斯坦利树近似算法来构建时延有界的低代价组播树,再通过最小时延路径与其他尚不在组播树的组内节点连接,并消除环路。理论和仿真表明,新算法与其他一些时延有界组播路由算法一样有较好的性能,并且有较小的复杂度。
A new QoS assured multicast routing algorithm is proposed. It constructs a time delay bounded lowcost multicast tree using modified Steiner tree heuristic, and then connects the remaining group members that are not on the constrained multicast tree through least delay paths withloop eliminated. The theory and simulation results show that the new algorithm has comparable performance with existing time delay bounded multicast routing algorithms.Moreover, the algorithm is with low complexity.
出处
《南京邮电学院学报（自然科学版）》
2003年第1期6-12,共7页
Journal of Nanjing University of Posts and Telecommunications
基金
江苏省自然科学基金(BK2001124)资助项目
