论文部分内容阅读
研究了两种场景下的路由热点博弈:一是用户可以将通信量分割成多块而选择多路由,二是用户在通信量不能分割时选择多路由.提出了一种路由热点博弈的形式化模型,在该模型下分析两种场景下纳什均衡的存在,并研究了两种场景中纳什均衡效率.通过对调和率的分析得出如下结论:两种场景中的调和率均是无边界的,只有当选择的路径中包含最少的热点时,网络才能达到最优的纳什均衡.
This paper studies the routing hot-game in two scenarios: one is to divide the traffic into multiple blocks and choose multiple routes, and the other is to choose multiple routes when the traffic can not be divided. A formal routing hot-game is proposed Model under which the existence of Nash equilibrium in two scenarios is analyzed and the Nash equilibrium efficiency in the two scenarios is studied. The analysis of the rate of reconciliation leads to the following conclusion: The reconcile rates in both scenarios are both borderless , The network can achieve the optimal Nash equilibrium only when the selected path contains the fewest hot spots.