基于粒子群和博弈论的QoS组播路由算法  

QoS Multicast Routing Algorithm Based on PSO and Game Theory

作　　者：成兰[1] 崔亚量[1] 鲍雅萍[1] 

机构地区：[1]安阳工学院科研处,安阳455000

出　　处：《计算机工程》2008年第14期92-94,共3页Computer Engineering

摘　　要：为改善互联网的服务质量(QoS)组播路由能力,设计一种基于多子群和博弈论的QoS组播路由算法。该算法由边评判、博弈分析和组播路由树建立等部分组成。基于适合隶属度函数对边进行模糊综合评判,利用博弈分析方法确定网络提供方与用户在边上的效用Nash均衡程度,通过组播路由树建立算法,在用户QoS要求得到满足的条件下,使得网络提供方效用与用户效用达到或接近Nash均衡意义下的Pareto最优。仿真实验验证了该算法的良好性能。For improving QoS multicast routing in Internet, based on multipopulation PSO and game theory, a new QoS multicast routing algorithm is proposed. It consists of three parts： edge evaluation, game analysis, and multicast tree construction. Based on the degree of membership functions, the candidate edges parameters are evaluated synthetically. Nash equilibrium between network provider utility and user utility are determined on candidate edges by game analysis, and attempts to construct a multicast routing tree with not only user QoS requirements satisfied, but also Pareto optimum under Nash equilibrium on network provider utility and user utility, achieved or approached by the proposed algorithm. The performance of the algorithm is verified by simulation.

关 键 词：服务质量组播路由 多子群粒子群 博弈论 NASH均衡 PARETO最优 

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