针对时延约束的最小代价组播树生成方法,提出一种快速有效的时延约束组播路由算法.该算法改进了KPP算法,设计了代价和时延动态优化的链路选择函数.在选择路径时,该算法综合考虑了时延和代价两个参数,保证了组播树的性能,降低了时间复杂度低.仿真结果表明,该算法能正确地构造出时延约束组播树,同时还具有较低的代价和计算复杂度.%A fast and effective delay-constrained multicast routing algorithm was put forward according to the generation of delay-constrained multicast tree.Referencing KPP, this algorithm designed a new path selection function which can balance cost and delay.In the mean time, this algorithm guaranteed the performance of multicast tree and has lower complexity while considering the optimization of cost and delay.The simulation results show that this algorithm can not only construct delayconstrained multicast tree correctly, but also has a less cost and a lower computational complexity than KPP.
展开▼
