一种基于对策论的拥塞控制方法  

A CONGESTION CONTROL ALGORITHM BASED ON GAME THEORY

作　　者：詹聪明[1] 舒静[2] 

机构地区：[1]华东师范大学计算机科学技术系,上海200062 [2]华东师范大学软件学院,上海200062

出　　处：《计算机应用与软件》2007年第9期172-174,196,共4页Computer Applications and Software

摘　　要：大部分端到端拥塞控制机制假设端用户是"合作"的,并且它们的实现严重依赖于这个假设。但是当网络中有"不合作用户"出现时,将可能因为不公平的资源竞争(如带宽)而发生拥塞甚至导致拥塞崩溃。现有的拥塞控制方法不能很好地解决这个问题。提出了一种基于对策论的拥塞控制方法——有效违规用户惩罚算法,它把网络上非合作用户竞争资源看成N人非合作对策。算法具有"惩恶扬善"的功能,并使得对策存在着唯一的纳什均衡,从而解决了存在"非合作用户"而导致的拥塞问题。仿真结果证明了算法的有效性。Most of the end-to-end congestion control schemes critically depend on end-user cooperation. In the presence of selfish users, it will lead to unfair competition for resource（ e. g. bandwidth）and deteriorate the congestion even into congestion collapse. The existing congestion control schemes can not resolve the problem effectively. A congestion control algorithm ESPA based on game theory is proposed. It regards resource competition as uncooperative network game ,punishes misbehaving users and rewards well behaving users. The network game will reach the state of Nash equilibrium by the algorithm. As a result,congestion control problem is resolved. Simulations illustrate that ESPA is effective.

关 键 词：拥塞控制 对策论 纳什均衡 有效违规用户惩罚算法 

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