计算机工程 ›› 2008, Vol. 34 ›› Issue (14): 92-94.doi: 10.3969/j.issn.1000-3428.2008.14.033

• 网络与通信 • 上一篇    下一篇

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

成 兰,崔亚量,鲍雅萍   

  1. (安阳工学院科研处,安阳 455000)
  • 收稿日期:1900-01-01 修回日期:1900-01-01 出版日期:2008-07-20 发布日期:2008-07-20

QoS Multicast Routing Algorithm Based on PSO and Game Theory

CHENG Lan, CUI Ya-liang, BAO YA-ping   

  1. (Research Office, Anyang Institute of Technology, Anyang 455000)
  • Received:1900-01-01 Revised:1900-01-01 Online:2008-07-20 Published:2008-07-20

摘要: 为改善互联网的服务质量(QoS)组播路由能力,设计一种基于多子群和博弈论的QoS组播路由算法。该算法由边评判、博弈分析和组播路由树建立等部分组成。基于适合隶属度函数对边进行模糊综合评判,利用博弈分析方法确定网络提供方与用户在边上的效用Nash均衡程度,通过组播路由树建立算法,在用户QoS要求得到满足的条件下,使得网络提供方效用与用户效用达到或接近Nash均衡意义下的Pareto最优。仿真实验验证了该算法的良好性能。

关键词: 服务质量组播路由, 多子群粒子群, 博弈论, Nash均衡, Pareto最优

Abstract: 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.

Key words: QoS multicast routing, multipopulation PSO, game theory, Nash equilibrium, Pareto optimum

中图分类号: