基于“适应活性”的QoS组播路由算法  

A QoS MULTICAST ROUTING ALGORITHM BASED ON ‘ADAPTIVE LIVING'

作　　者：王帅[1] 朱磊[1] 俞璐[1] 林万里[1] 

机构地区：[1]解放军理工大学通信工程学院,江苏南京210007

出　　处：《计算机应用与软件》2016年第5期265-269,277,共6页Computer Applications and Software

基　　金：2014年江苏省自然科学基金项目(BK20141071)

摘　　要：自然灾害、战争等特殊应用场景下通信网络易受到物理攻击和约束条件影响,难以为用户提供稳定服务。传统的QoS路由算法基于稳态网络,在物理攻击与多约束环境下难以适用。针对这一问题,首次提出并求解了"适应活性"模型以综合衡量节点及其相连链路的动态服务性能。进而通过改进蚁群算法,提出了基于"适应活性"的QoS组播路由算法。该算法能够结合外界环境、业务需求与网络状态,综合考虑链路与节点服务性能选择路径,在继承传统蚁群算法优点的同时,解决了外界环境影响节点性能变化导致选路无法达到QoS最优的问题。MATLAB仿真结果表明,该算法能够在网络性能变化时避开低性能节点,快速有效地选择QoS最优路径。In special application scenarios such as the natural disasters and the wars,communication networks are difficult to provide stable services to users because it is prone to the effects of physical attacks and multi-constraints. Traditional QoS routing algorithms are based on steady network,they are no longer suitable under the condition of physical attacks and multi-constraints. Aiming at this problem,in the paper we put forward and calculate for the first time the‘adaptive living＇model to comprehensively measure the dynamic service performance of network nodes and their connecting links. Furthermore,by improving the ant colony optimisation algorithm we put forward an ‘adaptive living＇-based QoS multicast routing algorithm. The algorithm can consider comprehensively the selection path of the link and the service performance of nodes in combination with the external environment,service requirements and network status,while inheriting the advantage of traditional ant colony optimisation,it solves the problem that the external environment affects the variation of node performance which in turn causes the path selection cannot reach Qo S optimum. Result of simulation on MATLAB shows that the algorithm can keep away from low performance nodes when the networks performance varying,and can fast and effectively select QoS optimal path.

关 键 词：物理攻击与多约束模型 QOS路由 适应活性 蚁群算法 

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