DraLCD: Another Traffic Engineering Method for Data Center Networks

被引：0
|
作者：
Yang Y. [1 ,2 ]
Yang J.-H. [1 ]
Qin D.-H. [3 ]
Wang Y.-D. [1 ]
Ling X. [1 ]
机构：
[1] Institute for the Network Sciences and Cyberspace, Tsinghua University, Beijing
[2] Xi'an Communication Institute, Xi'an, 710106, Shaanxi
[3] School of Information Science and Engineering, Guangxi University for Nationalities, Nanning, 530006, Guangxi
来源：
Tien Tzu Hsueh Pao/Acta Electronica Sinica | 2017年 / 45卷 / 05期
关键词：
Critical link; Multipath routing; Software defined network (SDN); Traffic balancing;
D O I：
10.3969/j.issn.0372-2112.2017.05.032
中图分类号：
学科分类号：
摘要：
Traffic balancing is proposed as a routing optimal goal in traffic engineering in order to avoid the network congestion.Because of data center traffic characteristics, traffic engineering of traditional IP networks may be not suitable to the data centers.Thus, we present a dynamic routing algorithm: DralCD (Dynamic Routing Algorithm based on Link Critical Degree), which is based on the link critical degree within SDN (Software Defined Network) framework.By the global visibility and making full use of the redundant paths in the network, DraLCD can realize the fine-grained traffic balancing while reducing the computing cost of controller and communication overhead between controller and switches, and finally achieves the goal of routing optimal.Furthermore, we design and perform the prototype of DraLCD on Mininet platform, and compare it with two other popular algorithms: ECMP (Equal-Cost Multi-Path) and GFF (Global First Fit).In our evaluations, the results show that DraLCD can significantly improve the network performance compared with the other two algorithms. © 2017, Chinese Institute of Electronics. All right reserved.
引用
收藏
页码：1261 / 1267
页数：6
相关论文
共 16 条
  • [1] Awduche D., Chiu A., Elwalid A., Et al., Overview and Principles of Internet Traffic Engineering
  • [2] Theophilus B., Aditya A., David A.M., Network traffic characteristics of datacenter in the wild, IMC '10: Proceedings of the 10th ACM SIGCOMM Conference on Internet Measurement, pp. 267-280, (2010)
  • [3] Ho T.V., Yves D., Olivier B., Et al., Traffic engineering for multiple spanning tree protocol in large data centers, ITC '11: Proceedings of the 23rd International Teletraffic Congress, pp. 23-30, (2011)
  • [4] Albert G., James R.H., Navendu J., Et al., VL2: A scalable and flexible data center network, Communications of the ACM, 54, 3, pp. 95-104, (2011)
  • [5] Wu X., Yang X.W., DARD: Distributed adaptive routing for datacenter networks, ICDCS'12: Proceedings of 32nd IEEE International Conference on Distributed Computing Systems, pp. 32-41, (2012)
  • [6] Ford A., Raiciu C., Handley M., Et al., Architectural Guidelines for Multipath TCP Development
  • [7] Mohammad A., Tom E., Sarang D., Et al., CONGA: Distributed congestion aware load balancing for datacenters, SIGCOMM '14: Proceedings of the 2014 ACM conference on SIGCOMM, pp. 503-514, (2014)
  • [8] Theophilus B., Ashok A., Aditya A., Et al., MicroTE: Fine grained traffic engineering for data centers, CoNEXT '11: Proceedings of the Seventh Conference on emerging Networking Experiments and Technologies, (2011)
  • [9] Ian F.A., Lee A., Wang P., Et al., A roadmap for traffic engineering in SDN-OpenFlow networks, Computer Networks, 71, 1, pp. 1-30, (2014)
  • [10] Mohammad A.L., Sivasankar R., Barath R., Et al., Hedera: Dynamic flow scheduling for data-center networks, NSDI'10: Proceedings of the 7th USENIX Conference on Networked Systems Design and Implementation, (2010)
12