摘要： 研究了覆盖(Overlay)多播路由中的有度约束的最小半径(DCMR)生成树问题,提出了一种新的基于度约束-延时综合和应用层拓扑优化双重策略的启发式贪心生成树算法——度-延时压缩树算法(DDCT)。仿真实验表明,与具有相同时间复杂度的同类路由算法相比,DDCT算法在多播树的半径、代价和链路重复分组数方面均表现出更好的性能。

关键词: 覆盖多播, 有度约束的最小半径问题, 路由算法

Abstract: This paper studies the problem of degree constrained minimum radius (DCMR) spanning tree in overlay multicast routing. A newheuristic greedy routing algorithm called degree-delay compact tree (DDCT), which is based on both degree constraints-delay integration andapplication layer topology optimum strategies, is proposed. The simulation results show that, comparing with similar algorithm having the samecomputing time complexity, the DDCT algorithm presents better performance all in radius, cost and link’s reduplicate packages of the overlaymulticast tree.

中图分类号: 

• TP393.02