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

doi:10.11772/j.issn.1001-9081.2016.09.2357

计算机应用 ›› 2016, Vol. 36 ›› Issue (9): 2357-2361.DOI: 10.11772/j.issn.1001-9081.2016.09.2357

• 网络与通信 • 下一篇

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

王仁群, 彭力

江南大学物联网工程学院, 江苏无锡 214000

收稿日期:2016-03-25 修回日期:2016-05-19 出版日期:2016-09-10 发布日期:2016-09-08
通讯作者: 王仁群
作者简介:王仁群(1991-),男,江苏盐城人,硕士研究生,主要研究方向:数据中心网络的拥塞控制和能耗管理;彭力(1967-),男,河北唐山人,教授,博士,CCF会员,主要研究方向:视觉物联网、无线传感网、数据中心网络。
基金资助:
国家自然科学基金资助项目（61502204）；江苏省产学研联合创新资金资助项目（BY2014024，BY2014023-362014，BY2014023-25）。

Topology-aware congestion control algorithm in data center network

WANG Renqun, PENG Li

School of Internet of Things Engineering, Jiangnan University, Wuxi Jiangsu 214000, China

Received:2016-03-25 Revised:2016-05-19 Online:2016-09-10 Published:2016-09-08
Supported by:
This work is partially supported by the National Natural Science Foundation of China (61502204), the Jiangsu Produce-Learn-Research Innovation Projects (BY2014024, BY2014023-362014, BY2014023-25).

摘要/Abstract

摘要： 针对数据中心网络（DCN）的链路拥塞问题，提出了一种拓扑感知型拥塞控制算法（TACC）。首先，根据广义超立方体拓扑多维正交和单维全连接的结构特点，结合网络流的最大流最小割定理，提出了拓扑感知地选取分布流量请求的不相交路径策略；然后，根据带宽需求自适应选取不相交路径；最后，利用已选取路径的剩余带宽为权重动态调整每条路径的流量分配比例，从而达到缓解网络链路拥塞、均衡网络负载和减轻目的节点侧数据重组压力的目的。实验结果表明，与链路关键性路由算法（LCRA）、多路径健忘路由算法（MORA）、最小割多路径路由（MCMP）算法和免拥塞路由策略（CFRS）相比，TACC算法在均衡链路负载和优化算法部署时间方面有良好的表现。

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

Abstract: 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 min-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), Multipath 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.

Key words: Data Center Network (DCN), congestion control, topology-aware, max-flow min-cut theorem, adaptive routing, dynamic weight distribution

中图分类号:

TP393

王仁群, 彭力. 数据中心网络拓扑感知型拥塞控制算法[J]. 计算机应用, 2016, 36(9): 2357-2361.

WANG Renqun, PENG Li. Topology-aware congestion control algorithm in data center network[J]. Journal of Computer Applications, 2016, 36(9): 2357-2361.

参考文献

[1] KANDULA S, SENGUPTA S, GREENBERG A, et al. The nature of data center traffic: measurements & analysis [C]// Proceedings of the 9th ACM SIGCOMM Conference on Internet Measurement. New York: ACM, 2009: 202-208.
[2] 李丹,陈贵海,任丰原,等.数据中心网络的研究进展与趋势[J].计算机学报,2014,37(2):259-274.(LI D, CHEN G H, REN F Y, et al. Data center network research progress and trends [J]. Chinese Journal of Computers, 2014, 37(2): 259-274.)
[3] 邓罡,龚正虎,王宏.现代数据中心网络特征研究[J].计算机研究与发展,2014,51(2):395-407.(DENG G, GONG Z H, WANG H. Characteristics research on modern data center network [J]. Journal of Computer Research and Development, 2014, 51(2): 395-407.)
[4] 魏祥麟,陈鸣,范建华,等.数据中心网络的体系结构[J].软件学报,2013,24(2):295-316.(WEI X L, CHEN M, FAN J H, et al. Architecture of the data center network [J]. Journal of Software, 2013, 24(2): 295-316.)
[5] 陆菲菲,谢向辉,郭得科,等.数据中心网络高效数据汇聚传输算法[J/OL].计算机学报,[2015-11-03]. http://www.cnki.net/KCMS/detail/11.1826.TP.20151103.1243.002.html.(LU F F, XIE X H, GUO D K, et al. Algorithm of efficient data aggregation transfers in data center networks [J/OL]. Chinese Journal of Computers, [2015-11-03]. http://www.cnki.net/KCMS/detail/11.1826.TP.20151103.1243.002.html.)
[6] SHOJAFAR M, CORDESCHI N, AMENDOLA D, et al. Energy-saving adaptive computing and traffic engineering for real-time-service data centers [C]// Proceedings of the 2015 IEEE International Conference on Communication Workshop. Piscataway, NJ: IEEE, 2015: 1800-1806.
[7] JYOTHI S A, DONG M, GODFREY P B. Towards a flexible data center fabric with source routing [C]// Proceedings of the 1st ACM SIGCOMM Symposium on Software Defined Networking Research. New York: ACM, 2015: Article No. 10.
[8] KODIALAM M, LAKSHMAN T V. Minimum interference routing with applications to MPLS traffic engineering [C]// Proceedings of the 19th Annual Joint Conference of the IEEE Computer and Communications Societies. Piscataway, NJ: IEEE, 2000, 2: 884-893.
[9] 唐治果,李乐民,虞红芳.针对MPLS网络流量工程的链路关键性路由算法[J].电子与信息学报,2007,29(5):1187-1190.(TANG Z G, LI L M, YU H F. Link criticality routing algorithm for MPLS traffic engineering [J]. Journal of Electronics and Information Technology, 2007, 29(5): 1187-1190.)
[10] LI Y, BAI B, HARMS J, et al. Stable and robust multipath oblivious routing for traffic engineering [C]// ITC '07: Managing Traffic Performance in Converged Networks, LNCS 4516. Berlin: Springer, 2007: 129-140.
[11] 杨华卫,王洪波,程时端,等.最小割多路径路由算法[J].软件学报,2012,23(8):2115-2129.(YANG H W, WANG H B, CHENG S D, et al. Min-cut multi-path routing algorithm [J]. Journal of Software, 2012, 23(8): 2115-2129.)
[12] LI Y, LI W, CHEN H, et al. Congestion-free routing strategy in software defined data center networks [J]. Concurrency and Computation Practice and Experience, 2015, 27(18): 5735-5748.
[13] DUH D R, CHEN G H, HSU D F. Combinatorial properties of generalized hypercube graphs [J]. Information Processing Letters, 1996, 57(1): 41-45.
[14] AZIZI S, HASHEMI N, AMIRI M. Comparison between topological properties of hyperX and generalized hypercube for interconnection networks [J]. International Journal of Applied Mathematics & Computer Science, 2013, 9(2): 111-122.
[15] KIM J. High-radix interconnection networks [D]. Palo Alto: Stanford University, 2008.
[16] 张铃.动态网络上最大流概念及其性质的研究[J].模式识别与人工智能,2013,26(7):609-614.(ZHANG L. The concept of max-flow and its properties in dynamic networks [J]. Pattern Recognition and Artificial Intelligence, 2013, 26(7): 609-614.)

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

Topology-aware congestion control algorithm in data center network

PDF

可视化

摘要/Abstract

引用本文

使用本文

参考文献

相关文章 15

编辑推荐

Metrics

[1]	谭静, 董程凤, 王慧强, 王贺哲, 冯光升, 吕宏武, 袁泉, 陈诗军. ERC²:具有拥塞控制策略的DTN传染路由方法[J]. 计算机应用, 2019, 39(1): 26-32.
[2]	蔡岳平, 张文鹏, 罗森. 基于最小接入保证带宽的数据中心网络带宽分配机制[J]. 计算机应用, 2017, 37(7): 1825-1829.
[3]	左雨星, 郭爱煌, 黄博, 王露. 基于网络效用最大化的车联网功率控制算法[J]. 计算机应用, 2017, 37(12): 3345-3350.
[4]	孙三山, 汪帅, 樊自甫. 软件定义网络架构下基于流调度代价的数据中心网络拥塞控制路由算法[J]. 计算机应用, 2016, 36(7): 1784-1788.
[5]	左成, 虞红芳. 基于软件定义网络的虚拟数据中心管理平台[J]. 计算机应用, 2016, 36(11): 2998-3005.
[6]	甘峰浩, 牛玉刚, 贾廷纲. 基于模糊压缩感知的无线传感网络拥塞控制算法[J]. 计算机应用, 2015, 35(9): 2430-2435.
[7]	申健夏靖波付凯孙昱. 基于历史相遇概率的容迟容断网络主动拥塞控制算法[J]. 计算机应用, 2014, 34(3): 644-648.
[8]	莫志超张未展王军郑炎. 基于云计算的P2P流媒体服务器集群部署算法[J]. 计算机应用, 2014, 34(2): 365-368.
[9]	吴小川张治学. 基于Fuzzy丢包区分的TCP自适应拥塞控制算法[J]. 计算机应用, 2013, 33(07): 1809-1812.
[10]	杨晓亚何万生. 基于路由队列资源自适应的非线性随机早期检测算法[J]. 计算机应用, 2013, 33(03): 621-624.
[11]	严黎明牛玉刚. 基于队列敏感性的无线接入网络拥塞控制算法[J]. 计算机应用, 2012, 32(01): 123-126.
[12]	麻海圆孟相如马志强周晶庄绪春. 基于种群生态的组播拥塞控制机制[J]. 计算机应用, 2011, 31(12): 3195-3199.
[13]	袁景凌刘华谢威蒋幸. 基于拥塞控制的片上网络多播路由算法[J]. 计算机应用, 2011, 31(10): 2630-2633.
[14]	田硕高仲合. 非线性高阶RED拥塞控制算法[J]. 计算机应用, 2011, 31(10): 2650-2653.
[15]	胡晗. 基于误码丢包率监测的无线TCP改进[J]. 计算机应用, 2011, 31(10): 2657-2659.