状态无关主动队列管理算法博弈的Nash均衡

Nash Equilibria in Oblivious Active Queue Management Game

状态无关的主动队列管理算法处理分组时不区分分组所在的流的信息,因此在Internet中,它易于设计和部署。文中通过数学分析和仿真方法研究AQM博弈和Nash均衡存在性。假设业务流是Poisson分布的且用户可自由修改发送速率,因而有结论:Drop Tail、RED不能获得Nash均衡,CHOKe可以获得近似Nash均衡。依据判定条件,推导出一种与状态无关且具有效率的Nash均衡AQM算法。

An oblivious active queue management scheme is one which does not differentiate between packets belonging to different flows, so it is easy to implement and depby in Interact. In this paper, study AQM game and the existence of Nash equilibria by mathematics analysis and simulation, Assume that the traffic sources are Poisson but the users can control the average rate. Find that Drop Tail and RED do not impose Nash equilibria, CHOKe can impose a nearly Nash equilibria. According to the Nash equilibria condition, a new stateless and efficient AQM scheme that impose a Nash equilibria is also presented.