延迟约束多播路由问题的分支优化算法  

A Branch Optimization Algorithm for the Delay Constrained Multicast Routing Problem

作　　者：张品[1] 李乐民[2] 王晟[2] 

机构地区：[1]杭州电子科技大学通信学院,浙江杭州310018 [2]电子科技大学光纤通信重点实验室,四川成都610054

出　　处：《电子学报》2006年第6期1114-1118,共5页Acta Electronica Sinica

基　　金：国家自然科学基金(No.60472008);浙江省自然科学人才基金(No.R105473)

摘　　要：QoS保证下的多播服务对于许多多媒体实时应用程序是重要的,QoS约束下的多播路由协议要求寻找连接源节点和目标节点集的支撑树使得端到端的QoS约束得以满足同时优化网络资源消耗,延迟约束最小代价树DCST是其中的关键问题.本文提出一个关于DCST的分支优化算法,该算法的核心思想是通过反向分支调节过程调整不满足QoS约束的路径并且减少对原支撑树结构的影响.仿真显示本文的算法对于实际网络是有效的.Multicast service with Quality of Service （QoS） guarantees is critical to many real-time multimedia intemet applications. The QoS-aware multicast routing protocols should have the ability to find a sourced-based tree with the end to end QoS bounds and the minimal network resource consuming. The Delay Constrained Steiner Tree problem （DCST） is one of the key issues. We present the Branch Optimization algorithm for DCST. The core of our algorithm called Reverse Branch Adjusting Procedure （RBAP） is proposed to adjust the paths violating the delay constraint at the same time keep the modification to the spanning tree as little as possible. The simulation shows that our algorithm is efficient for actual networks.

关 键 词：QOS路由 STEINER TREE 多播 分支节点 

分 类 号：TN915.01[电子电信—通信与信息系统]