一种基于非合作博弈的均衡路由方法  

Balanced route arithmetic based noncooperative game theory

作　　者：张惠娟[1] 周利华[1] 翟鸿鸣[2] 

机构地区：[1]西安电子科技大学计算机学院 [2]交通银行上海总行,上海200033

出　　处：《西安电子科技大学学报》2007年第3期398-401,共4页Journal of Xidian University

基　　金：国家重点基础研究发展计划(973)项目(2005CB321904)

摘　　要：针对路由器路径选择中的资源分配不均衡问题,提出了基于博弈论思想的解决方案.将IPv6协议中的任意博路由过程看作是多个非合作参与者间的博弈问题,给出了以单个参与者在各条链路上的速率分配为博弈策略、以该参与者的延迟时间为博弈效用的路由器路由博弈模型,求解了保证该博弈模型处于均衡状态时的Nash均衡解.在此基础上,提出了保证多个参与者公平使用网络链路的均衡路由算法.仿真实验表明,该算法使得各个参与者在网络中延迟时间少,且对各个参与者是公平的,解决了路由器路径选择中资源的均衡性分配问题.Because of the unbalanced resource distribution in the path choice of the router, a new gametheoretic approach is presented, which regards the anycast route of IPv6 as an uncooperate game in many players. A game model with a player＇s rate distribution stratety and delay avail in all paths is given. The player＇s rate distribution which can assure the Nash equilibrium is solved. Based on the Nash Equilibrium, a balanced route arithmetic which asscures the best delay and the fair distribution in all players is presented. Simulation results indicate that this arithmetic can solve the balanced resource distribution in the router in effect.

关 键 词：资源分配 非合作博弈 NASH均衡 均衡路由 

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