多约束QoS动态多播路由算法  

A Dynamic Multicast Routing Algorithm with Multiple QoS Con straints

作　　者：许毅[1] 李腊元[1] 

机构地区：[1]武汉理工大学,武汉430063

出　　处：《计算机工程与应用》2004年第15期17-19,22,共4页Computer Engineering and Applications

基　　金：国家自然科学基金资助项目(批准号:60172035);湖北省自然科学基金资助项目(编号:2000J154)

摘　　要：YAM和QoSMIC是支持QoS动态多播路由算法,允许多播组成员动态地加入/退出,同时为接收方提供多个可选择的多播接入路径,以满足不同应用的QoS需求。该文在分析这些算法的基础上,研讨了具有延迟、延迟抖动、带宽和代价等多约束QoS的多播路由问题,描述了一种适应于研究QoS多播路由的网络模型,提出了一种具有多约束QoS的动态多播路由算法(MQDMR),MQDMR试图有效地减少生成多约束QoS的多播树的开销。在MQDMR中,一个多播组成员能动态地加入/退出一个多播会晤,且不干扰现有的多播树。仿真实验结果表明,MQDMR比YAM和QoSMIC具有较小的延时和较少的代价。QoS dynamic multicast routing Algorithms such as YAM and QoSMIC allow receivers to access and leave the group freely,they can find the most suitable path to access existing multicast trees while meeting the user's QoS requirements.This paper discusses the multicast routing problem with multiple QoS constraints,which may deal with the delay,delay jitter,bandwidth and cost metrics,and describes a network model for researching the routing problem.It presents a dynamic multicast routing algorithm with multiple QoS constraints(MQDMR).The MQDMR attempts to signi-ficantly reduce the overhead of constructing a multicast tree with multiple QoS constraints.In MQDMR,a multicast group member can join or leave a multicast session dynamically,which should not disrupt the multicast tree.Simulation results show that MQDMR is less delay and cost than YAM and QoSMIC.

关 键 词：动态多播路由 算法 多约束QOS QOS路由 

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