数据中心网络负载均衡中的带宽碎片问题研究

发布时间：2018-03-04 04:34

本文选题：数据中心网络　切入点：负载均衡　出处：《上海交通大学》2014年硕士论文　论文类型：学位论文

【摘要】：现有的基于流的数据中心网络负载均衡方法主要以满足流的带宽需求为目的，缺乏对流的带宽需求和链路容量之间的差值的考虑，可能导致多条链路上存在大量可用的带宽容量，但无法将它们集中以满足单一流的带宽需求。本课题针对上述带宽碎片问题，类比操作系统动态内存分配算法中对减少内存碎片所做的优化，提出了带宽最紧匹配路径分配算法和概率路径分配算法。根据上述思路，本课题的研究工作包括：1）基于已有的数据中心网络流调度算法，提出并分析带宽碎片问题；2）提出带宽最紧匹配路径分配算法并基于OpenFlow协议进行实现；3）针对带宽最紧匹配路径分配算法中可能出现的链路负载不均衡等问题进行分析，进一步提出概率路径分配算法。基于Mininet仿真器的实验表明，，在多种不同的数据中心网络流量模式下，本课题所提出的路径分配方法相比其它研究工作中的方法和传统的ECMP方法，可以达到更高的吞吐率和带宽利用率。并且，随着流经核心交换机的流的比例的增加，概率路径分配算法比带宽最紧匹配路径分配算法具有更高的吞吐率和带宽利用率。
[Abstract]:The existing flow based data center network load balancing method mainly aims to meet the bandwidth requirements of the flow, and lacks the consideration of the difference between the convection bandwidth demand and the link capacity. It may lead to a large number of available bandwidth capacity on multiple links, but can not be centralized to meet the single first-class bandwidth requirements. In order to solve the bandwidth fragmentation problem, this paper compares the optimization of the dynamic memory allocation algorithm in the operating system to reduce the memory fragmentation, and proposes the path allocation algorithm and the probabilistic path allocation algorithm. According to the above ideas, the research work of this subject includes: 1) based on the existing data center network flow scheduling algorithm, This paper proposes and analyzes the bandwidth fragmentation problem (2) proposes a bandwidth most tight matching path allocation algorithm and implements it based on OpenFlow protocol) and analyzes the possible link load imbalance in the bandwidth most tight matching path allocation algorithm. Furthermore, a probabilistic path assignment algorithm is proposed. The experiments based on Mininet simulator show that the path assignment method proposed in this paper compares with other research methods and traditional ECMP methods in different data center network traffic modes. The probabilistic path assignment algorithm has higher throughput and bandwidth utilization than the narrowest bandwidth matching path allocation algorithm with the increase of the proportion of flows flowing through the core switch.
【学位授予单位】：上海交通大学
【学位级别】：硕士
【学位授予年份】：2014
【分类号】：TP308

【共引文献】