一种满足多服务质量约束的动态组播路由算法  

Dynamic Multicast Routing Algorithm Satisfying Multiple QoS Constraints

作　　者：王立[1] 李增智[1] 宋承谦[1] 陈彦萍[1] 

机构地区：[1]西安交通大学计算机系统结构与网络研究所,西安710049

出　　处：《西安交通大学学报》2004年第4期420-423,共4页Journal of Xi'an Jiaotong University

基　　金：国家自然科学基金资助项目(90304006);教育部高等学校博士学科点专项科研基金资助项目(20020698018).

摘　　要：建立了网络模型,描述、简化了研究的问题,并提出了一种新的满足多服务质量(QoS)约束的动态组播路由算法(DMRMQ).该算法采用Bellman Ford算法作为路径搜索算法,能在满足带宽、延迟、延迟抖动和丢包率约束的前提下确定具有最小跳数和开销的动态组播路由.仿真实验表明,在假定网络节点输出链路容量相等的情况下,与Greedy、LeastHop两种不考虑QoS的算法相比,DMRMQ能在满足多QoS约束的前提下建立动态组播路由,且路由请求平均成功率提高约10%,路由平均延迟降低约20%,路由平均跳数基本持平.A dynamic multicast routing algorithm satisfying multiple QoS constraints named DMRMQ has been proposed. DMRMQ uses a modified Bellman-Ford algorithm as a path search algorithm, and it can build a multicast tree with the least hops and costs after satisfying bandwidth, delay, delay jitter and loss constraints. Under the condition that the output link capabilities of network nodes are equivalent, simulation results show that DMRMQ has better performance than the multicast routing algorithms that does not satisfying any QoS constraint; the success rate of routing request is improved about 10%, the routing delay is reduced about 20%, and the routing hop is nearly unchanged by using DMRMQ.

关 键 词：动态组播路由 服务质量约束 Bellman—Ford算法 

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