一种基于思维进化计算和博弈论的QoS组播路由算法  

A QoS Multicast Routing Algorithm Based on Mind Evolutionary Computation and Game Theory

作　　者：王军伟[1] 王兴伟[1] 黄敏[1] 

机构地区：[1]东北大学信息科学与工程学院

出　　处：《东北大学学报（自然科学版）》2008年第2期201-204,212,共5页Journal of Northeastern University(Natural Science)

基　　金：教育部新世纪优秀人才支持计划项目;国家自然科学基金资助项目(60473089);国家发改委CNGI示范工程项目(CNGI-04-13-2T,CNGI-04-6-2T,CNGI-04-15-7A)

摘　　要：针对满足多个约束条件的服务质量(QoS)组播路由的特点,提出了一种应用于下一代互联网的基于思维进化计算和博弈论的QoS组播路由算法.该算法由三部分组成:引入隶属度函数来描述"边"对用户QoS需求的适合程度;通过博弈分析判断网络方与用户在"边"上的效用能否达到Nash均衡;采用思维进化计算方法建立组播路由树,使得在树上不仅用户QoS要求得到满足而且网络方效用与用户效用达到或接近Nash均衡下的Pareto最优.仿真结果表明,提出的算法是可行和有效的.Taking the characteristics of multi-constraint QoS（quality of service） routing in NGI （next generation Internet） into account, a QoS multicast routing algorithm based on MEC（mind evolutionary computation） and game theory is presented. It introduces the membership functions to evaluate the adaptability of candidate edges to users＇ requirements for QoS; makes sure of whether the network provider has been in Nash equilibrium with users in respect to the utility on edges through gaming analysis; constructs a multicast routing tree via MEC so as to enable users＇ QoS requirements to be satisfied and the utility of both network provider and users to reach or approach Pareto optimum when both are in Nash equilibrium. Simulation results showed that the proposed algorithm is feasible and effective.

关 键 词：服务质量 组播路由 思维进化计算 博弈分析 NASH均衡 

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