ISSN 1000-1239 CN 11-1777/TP

计算机研究与发展 ›› 2016, Vol. 53 ›› Issue (6): 1306-1313.doi: 10.7544/issn1000-1239.2016.20148400

• 网络技术 • 上一篇    下一篇

基于合作博弈的数据中心骨干网带宽分配策略

孟飞,兰巨龙,胡宇翔   

  1. (国家数字交换系统工程技术研究中心 郑州 450002) (mf472933350@126.com)
  • 出版日期: 2016-06-01
  • 基金资助: 
    国家“九七三”重点基础研究发展计划基金项目(2012CB315901,2013CB329104);国家自然科学基金项目(61372121);国家“八六三”高技术研究发展计划基金项目(2013AA013505)

A Cooperative Game Based Data Center Backbone Network Bandwidth Allocation Policy

Meng Fei, Lan Julong, Hu Yuxiang   

  1. (National Digital Switching System Engineering & Technological R&D Center, Zhengzhou 450002)
  • Online: 2016-06-01

摘要: 数据中心(data center, DC)之间通过部署流量工程来提高连接各个数据中心骨干网的利用率,虽然效率提升显著,但对不同类型汇聚流的带宽分配的公平性没有考虑.将多个汇聚流对带宽分配的竞争行为建模为一个合作博弈,通过寻求此博弈的纳什谈判解(Nash bargaining solution, NBS)来确定优化的带宽分配策略CGBA(cooperation game based bandwidth allocation),权衡各汇聚流的最小带宽保证与带宽分配的公平性.在Mininet平台上进行实验仿真并和典型的带宽分配策略对比,结果表明CGBA不但可保证各汇聚流的最小带宽需求,还确保了各类流对带宽资源竞争的公平性.

关键词: 数据中心, 合作博弈理论, 纳什谈判解, 带宽分配, Mininet

Abstract: 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.

Key words: data centers (DC), cooperative game theory, Nash bargaining solution (NBS), bandwidth allocation, Mininet

中图分类号: