BiTE: a dynamic bi-level traffic engineering model for load balancing and energy efficiency in data center networks

With the recent significant growth of virtualization and cloud services, the data center network (DCN) as the underlying infrastructure is more important. The increasing and changing volume of workloads highlights critical issues such as load balancing and energy efficiency in data centers. Large path diversity in DCNs introduces multipath forwarding as a promising approach to improve load distribution. However, the over-provisioned DCNs consume large amounts of power while the network is under full capacity most of the time. Accordingly, this paper proposes BiTE, a dynamic bi-level traffic engineering (TE) scheme in a hierarchical Software Defined Networking (SDN)-based DCN to strike a balance between load balancing and energy efficiency objectives. BiTE consists of decision-making problems at two levels modeled as a multi-period bi-level optimization problem, where each decision maker optimizes one of objectives. According to the inherent complexity of bi-level programming, a co-evolutionary metaheuristic algorithm is proposed for solving BiTE. BiTE performance is evaluated in comparison to NSGA-II algorithm and four previously proposed TE schemes in terms of several load balancing and energy saving metrics under different scenarios. The results show that BiTE performs well in traffic load balancing while preserves the energy efficiency. We apply the Analytic Hierarchy Process (AHP) method to multi-criteria analyze and rank the performance of studied TE mechanisms. AHP results for different scenarios indicate that BiTE is in first or second place in terms of the overall performance score among six studied approaches.

[1]  Albert G. Greenberg,et al.  VL2: a scalable and flexible data center network , 2009, SIGCOMM '09.

[2]  Joseph D. Touch,et al.  Transparent interconnection of lots of links (TRILL): problem and applicability statement , 2022 .

[3]  Ming Zhang,et al.  The Case for Fine-Grained Traffic Engineering in Data Centers , 2010, INM/WREN.

[4]  Jeffrey C. Mogul,et al.  NetLord: a scalable multi-tenant network architecture for virtualized datacenters , 2011, SIGCOMM 2011.

[5]  Bin Liu,et al.  GreenTE: Power-aware traffic engineering , 2010, The 18th IEEE International Conference on Network Protocols.

[6]  David Harrington,et al.  Definitions of Managed Objects for Bridges with Rapid Spanning Tree Protocol , 2005, RFC.

[7]  Kanya Godde,et al.  An Introduction to Statistical Analysis in Research: With Applications in the Biological and Life Sciences , 2017 .

[8]  Seyedali Mirjalili,et al.  Dragonfly algorithm: a new meta-heuristic optimization technique for solving single-objective, discrete, and multi-objective problems , 2015, Neural Computing and Applications.

[9]  Deep Medhi,et al.  Network routing - algorithms, protocols, and architectures , 2007 .

[10]  Thomas Stützle,et al.  Ant Colony Optimization , 2009, EMO.

[11]  David A. Maltz,et al.  Network traffic characteristics of data centers in the wild , 2010, IMC '10.

[12]  H. Jonathan Chao,et al.  Dynamic flow scheduling for Power-efficient Data Center Networks , 2016, 2016 IEEE/ACM 24th International Symposium on Quality of Service (IWQoS).

[13]  Roberto Montemanni,et al.  Ant colony optimization for real-world vehicle routing problems , 2007, Swarm Intelligence.

[14]  David Abramson,et al.  A comparison of two methods for solving 0–1 integer programs using a general purpose simulated annealing algorithm , 1996, Ann. Oper. Res..

[15]  Misbah Mubarak,et al.  Predicting the Performance Impact of Different Fat-Tree Configurations , 2017, SC17: International Conference for High Performance Computing, Networking, Storage and Analysis.

[16]  Ke Xu,et al.  Routing On Demand: Toward the Energy-Aware Traffic Engineering with OSPF , 2012, Networking.

[17]  Jie Lu,et al.  An extended Kuhn-Tucker approach for linear bilevel programming , 2005, Appl. Math. Comput..

[18]  Albert G. Greenberg,et al.  The nature of data center traffic: measurements & analysis , 2009, IMC '09.

[19]  Siva Shankar Chandrasekaran.  Understanding Traffic Characteristics in a Server to Server Data Center Network , 2017 .

[20]  Geoffrey C. Fox,et al.  A Comparison of Annealing Techniques for Academic Course Scheduling , 1997, PATAT.

[21]  Heinrich von Stackelberg,et al.  Stackelberg (Heinrich von) - The Theory of the Market Economy, translated from the German and with an introduction by Alan T. PEACOCK. , 1953 .

[22]  Leandro dos Santos Coelho,et al.  A population-based simulated annealing algorithm for global optimization , 2016, 2016 IEEE International Conference on Systems, Man, and Cybernetics (SMC).

[23]  Sujata Banerjee,et al.  ElasticTree: Saving Energy in Data Center Networks , 2010, NSDI.

[24]  Kenneth J. Christensen,et al.  Saving energy in LAN switches: New methods of packet coalescing for Energy Efficient Ethernet , 2011, 2011 International Green Computing Conference and Workshops.

[25]  Christian E. Hopps,et al.  Analysis of an Equal-Cost Multi-Path Algorithm , 2000, RFC.

[26]  Deep Medhi,et al.  On traffic fairness in data center fabrics , 2014, 2014 IEEE 3rd International Conference on Cloud Networking (CloudNet).

[27]  Yonggang Wen,et al.  Data Center Energy Consumption Modeling: A Survey , 2016, IEEE Communications Surveys & Tutorials.

[28]  Kai Zhang,et al.  An improved ant colony optimization for communication network routing problem , 2009 .

[29]  Pedro Reviriego,et al.  An energy consumption model for Energy Efficient Ethernet switches , 2012, 2012 International Conference on High Performance Computing & Simulation (HPCS).

[30]  Jonathan F. Bard,et al.  Practical Bilevel Optimization , 1998 .

[31]  Laurent Lefèvre,et al.  Segment routing based traffic engineering for energy efficient backbone networks , 2014, 2014 IEEE International Conference on Advanced Networks and Telecommuncations Systems (ANTS).

[32]  Xin-She Yang,et al.  Nature-Inspired Optimization Algorithms: Challenges and Open Problems , 2020, J. Comput. Sci..

[33]  Amin Vahdat,et al.  A scalable, commodity data center network architecture , 2008, SIGCOMM '08.

[34]  Guangquan Zhang,et al.  An Extended Kth-Best Approach For Referential-Uncooperative Bilevel Multi-Follower Decision Making , 2008, Int. J. Comput. Intell. Syst..

[35]  Ming Zhang,et al.  MicroTE: fine grained traffic engineering for data centers , 2011, CoNEXT '11.

[36]  Yaoguang Hu,et al.  A solution to bi/tri-level programming problems using particle swarm optimization , 2016, Inf. Sci..

[37]  Marco Dorigo,et al.  Ant system: optimization by a colony of cooperating agents , 1996, IEEE Trans. Syst. Man Cybern. Part B.

[38]  El-Ghazali Talbi,et al.  A Taxonomy of Metaheuristics for Bi-level Optimization , 2013 .

[39]  Deep Medhi,et al.  Striking a Balance Between Traffic Engineering and Energy Efficiency in Virtual Machine Placement , 2015, IEEE Transactions on Network and Service Management.

[40]  Pavel Novoa-Hernández,et al.  A Hybrid Approach for Solving Dynamic Bi-level Optimization Problems , 2018, Computación y Sistemas.

[41]  G. Anandalingam,et al.  A penalty function approach for solving bi-level linear programs , 1993, J. Glob. Optim..

[42]  Mark Handley,et al.  Data center networking with multipath TCP , 2010, Hotnets-IX.

[43]  Laxmi N. Bhuyan,et al.  DREAM: DistRibuted Energy-Aware traffic Management for Data Center Networks , 2019, e-Energy.

[44]  Charles E. Blair,et al.  Computational Difficulties of Bilevel Linear Programming , 1990, Oper. Res..

[45]  Qian,et al.  Simulated Annealing for the 0/1 Multidimensional Knapsack Problem , 2007 .

[46]  Amin Vahdat,et al.  Hedera: Dynamic Flow Scheduling for Data Center Networks , 2010, NSDI.

[47]  Otto Carlos Muniz Bandeira Duarte,et al.  A high-performance Two-Phase Multipath scheme for data-center networks , 2017, Comput. Networks.

[48]  David Thaler,et al.  Multipath Issues in Unicast and Multicast Next-Hop Selection , 2000, RFC.

[49]  Lotfi Mhamdi,et al.  A survey on architectures and energy efficiency in Data Center Networks , 2014, Comput. Commun..

[50]  Pierre Hansen,et al.  New Branch-and-Bound Rules for Linear Bilevel Programming , 1989, SIAM J. Sci. Comput..

[51]  Aditya Akella,et al.  Understanding data center traffic characteristics , 2009, WREN 2009.

[52]  Martin Skutella,et al.  An Introduction to Network Flows over Time , 2008, Bonn Workshop of Combinatorial Optimization.

[53]  Muqing Wu,et al.  An Optimization Routing Algorithm Based on Segment Routing in Software-Defined Networks , 2018, Sensors.

[54]  Fung Po Tso,et al.  Improving Data Center Network Utilization Using Near-Optimal Traffic Engineering , 2013, IEEE Transactions on Parallel and Distributed Systems.

[55]  Xin-She Yang,et al.  Chapter 5 – Genetic Algorithms , 2014 .

[56]  Sujata Banerjee,et al.  DevoFlow: scaling flow management for high-performance networks , 2011, SIGCOMM 2011.