一个快速的时延有界低代价多播路由算法  

A FAST ROUTING ALGORITHM FOR DELAY-CONSTRAINED LOW-COST MULTICAST

作　　者：杨明[1] 谢希仁[1] 

机构地区：[1]解放军理工大学计算机科学系,南京210016

出　　处：《计算机研究与发展》2000年第6期726-730,共5页Journal of Computer Research and Development

摘　　要：基于QoS的多播路由算法需要在满足每个个体QoS需求的同时，又能高效管理网络资源．提出了一种满足端到端时延限制的低代价多播路由算法．算法使用一个修改的Steiner构近似算法先构建时延有界的低代价多播树，再通过最小时延路径与其它尚不在多播树的组结点相连．计算机仿真结果表明，新算法与其它一些时延有界多播路由算法相比有很好的性能，并且避免了许多同类算法常见的高复杂性．QoS-based multicast routing algorithms are required to satisfy the QoS requirements of each individual application and to manage network resource efficiently. A new heuristic algorithm is presented for constructing low-cost multicast tree with end-to-end delay constraints. It first constructs a constrained low-cost multicast tree using a modified Steiner tree heuristic, and then connects the rest group members which are not on the constrained multicast tree using least delay paths. The simulation results show that its per formance compares well with other known delayconstrained heuristics. Moreover, the algorithm does not suffer from high complexity common to most delay-constrained heuristics.

关 键 词：多播路由算法 时延限制 服务质量 STEINER树 

分 类 号：TP393[自动化与计算机技术—计算机应用技术]