一种基于Nash均衡的路由器队列管理方法  

A router queue management approach based on Nash equilibrium

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

机构地区：[1]西安电子科技大学多媒体研究所 [2]交通银行上海总行,上海200033

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

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

摘　　要：针对常用路由器队列管理的资源分配不公平性问题,基于博奕论思想,将路由器队列管理过程看作是多个参与者间的非合作博奕问题,提出了具有惩罚策略和最佳效用的路由器队列管理方案.以丢弃概率为博奕策略,以路由器输出速率为博奕效用,构建路由器丢弃算法博奕模型,求解了保证该博奕模型处于Nash均衡解时的丢弃概率函数,确保路由器以此概率函数丢弃业务时,输出速率最佳.构建了路由器调度算法博奕模型,该调度算法对贪婪业务提供较小服务量,起到惩罚作用,而对输入速率较小的业务,尽可能提供服务.仿真实验表明,该方法能有效解决路由器队列管理中的资源分配不公平性问题.In order to solve the problem of the unfair resource distribution, the router queue management is regarded as an uncooperate game with many players, and based on the game theory, a new router queue management approach with the punishment strategy and the best output avail is presented. The drop arithmetic game model with drop probability strategy and output avail is given, and the drop probability that can assure the game to reach the Nash equilibrium is solved. When the router drops traffics by this drop probability, the output is the best. A schedule arithmetic game with the aim of rewards and punishment is constructed, and the router can provide less service for the greedy traffics and do the best for the other traffics by this arithmetic. The Simulation result indicates that this new approach can effectively solve the unfair resource distribution in the router.

关 键 词：资源分配 NASH均衡 路由器队列管理 惩罚策略 

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