数据中心（data center ，DC）之间通过部署流量工程来提高连接各个数据中心骨干网的利用率，虽然效率提升显著，但对不同类型汇聚流的带宽分配的公平性没有考虑。将多个汇聚流对带宽分配的竞争行为建模为一个合作博弈，通过寻求此博弈的纳什谈判解（Nash bargaining solution ，NBS）来确定优化的带宽分配策略 CGBA（cooperation game based bandwidth allocation ），权衡各汇聚流的最小带宽保证与带宽分配的公平性。在 Mininet 平台上进行实验仿真并和典型的带宽分配策略对比，结果表明CGBA 不但可保证各汇聚流的最小带宽需求，还确保了各类流对带宽资源竞争的公平性。%Currently ,traffic engineering is typically deployed to improve the utilization of data centers (DC) backbone networks ,which usually belongs to the same online service providers .Although the efficiency is remarkable ,the bandwidth allocation fairness of different aggregate flow isn’t considered . Hence ,the QoS guarantee is restricted .Because the bandwidth resource is expensive and packet loss is typically thought unacceptable ,the bandwidth utilization should be maximized ,at the same time , the QoS guarantee of different flow should be improved .In this paper ,the problem of contending the share bandwidth is modeled as a cooperative game ,and different aggregate flow compets the share bandwidth and maximizes the overall bandwidth resource utilization simultaneously ,and the optimal bandwidth allocation policy ,called cooperation game based bandwidth allocation (CGBA) ,is obtained through searching the Nash bargaining solution (NBS) of the game and balancing the tradeoff between minimum bandwidth guarantee and bandwidth allocation fairness .Simulation on a Mininet testbed shows that the proposed policy can effectively guarantee minimum bandwidth of each aggregate flow while ensuring the allocation fairness , compared with three other classical bandwidth allocation policies .
展开▼
