基于非合作博弈的OpenFlow交换机迁移机制

Open Flow switch migration mechanism based on non-cooperative game

软件定义网络(software defined network,SDN)分布式控制平面的负载均衡主要通过交换机迁移实现,但现有算法仅考虑了CPU一维控制资源,且基于集中式算法实现,复杂度较高。针对这一问题,将交换机迁移决策抽象为在三维资源(CPU、带宽和存储)限制下的资源效用最大化问题;然后将其等效为零和博弈中的收益最大化问题,并设计了一种合成分布式博弈算法;最后在Beacon控制器实现了该算法。实验结果显示该方案的流表安装时间具有最低振荡曲线,且时间都小于100 ms,近似最优方案。

The load balancing of distributed control plane in SDN （ software defined network） is mainly conducted through switch migration. However, existing switch migration algorithms only considered the CPU resource and were implemented in centralized style which was complicated. This paper modeled the switch migration problem as a resource utility maximization problem under the restrictions of the three dimensional resources （ CPU, bandwidth and storage）, and then equivalented it to revenue maximization problem in a zero-sum game. This paper also designed a distributed solution called synthesizing distributed game algorithm and implemented it in the Beacon controller. Evaluation results show that flow setup time has the lowest oscillation curve,which is less than 100 ms and approximates the optimal solution.