数据中心网络拓扑感知型拥塞控制算法  

Topology-aware congestion control algorithm in data center network

作　　者：王仁群[1] 彭力[1] 

机构地区：[1]江南大学物联网工程学院,江苏无锡214000

出　　处：《计算机应用》2016年第9期2357-2361,共5页journal of Computer Applications

基　　金：国家自然科学基金资助项目(61502204);江苏省产学研联合创新资金资助项目(BY2014024;BY2014023-362014;BY2014023-25)~~

摘　　要：针对数据中心网络(DCN)的链路拥塞问题,提出了一种拓扑感知型拥塞控制算法(TACC)。首先,根据广义超立方体拓扑多维正交和单维全连接的结构特点,结合网络流的最大流最小割定理,提出了拓扑感知地选取分布流量请求的不相交路径策略;然后,根据带宽需求自适应选取不相交路径;最后,利用已选取路径的剩余带宽为权重动态调整每条路径的流量分配比例,从而达到缓解网络链路拥塞、均衡网络负载和减轻目的节点侧数据重组压力的目的。实验结果表明,与链路关键性路由算法(LCRA)、多路径健忘路由算法(MORA)、最小割多路径路由(MCMP)算法和免拥塞路由策略(CFRS)相比,TACC算法在均衡链路负载和优化算法部署时间方面有良好的表现。To solve the congestion problem of links in Data Center Network （DCN）, a Topology-Aware Congestion Control （TACC） algorithm was proposed in data center networks. According to the properties of multi-dimensional orthogonality and single-dimensional full mesh in the generalized hypercube, a topology-aware strategy was put forward to find the disjoint routes of distributing the request of flow by the max-flow rain-cut theorem. Then, the disjoint routes were adjusted adaptively for satisfying the bandwidth requirement. Finally, the residual bandwith of the selected path was used as the weight to dynamically adjust the flow distribution of each route, so as to achieve the purpose of alleviating network congestion, balancing the load of links and reducing the pressure of recombining data in the destination. The experimental results show that in comparison with Link Criticality Routing Algorithm （LCRA）, Muhipath Oblivious Routing Algorithm （MORA）, Min-Cut Multi-Path （MCMP） and Congestion-Free Routing Strategy （CFRS）, TACC algorithm has good performance in link load balancing and deployment time.

关 键 词：数据中心网络 拥塞控制 拓扑感知 最大流最小割定理 自适应路由 动态权重分配 

分 类 号：TP393[自动化与计算机技术—计算机应用技术]