两种带多约束的组播路由算法(英文)  

Two multi-constrained Multicast QoS Routing Algorithm

作　　者：黄林[1] 赖俊峰[2] 侯剑[2] 

机构地区：[1]中国计量学院,杭州310018 [2]内蒙古工业大学,呼和浩特010051

出　　处：《系统仿真学报》2009年第21期6774-6776,6780,共4页Journal of System Simulation

基　　金：The Research Fund of Inner Mongolia University of Technology (X200829)

摘　　要：组播对其成员节点能够提供服务质量,且组播在未来通信网络当中起到越来越重要的角色。对多约束斯坦利最小树问题,提出了基于Boruvka方法的多约束组播算法(BMCMRA)与基于Kruskal方法的多约束组播算法(KMCMRA)。仿真试验表明算法具有良好代价性能,且能够很好地满足多约束条件。Multicast routing algorithms that are capable of providing quality of service （QoS） to its members will play an important role in future communications networks. For the multi-constrained minimum Steiner tree problem, a Boruvka-based multi-constrained multicast routing algorithm （BMCMRA） and a Kruskal-based multi-constrained multicast routing algorithm （KMCMRA） were proposed. Simulation results illustrate the algorithms have features of well performance of cost and guarantee QoS multiple constraints.

关 键 词：组播 斯坦利树 服务质量 多约束 

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