Abstract

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.

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.