Routing-Led Evolutionary Algorithm for Large-Scale Multi-Objective VNF Placement Problems
By: Peili Mao , Joseph Billingsley , Wang Miao and more
Modern data centers contain thousands of servers making them major consumers of electricity. To minimize their environmental impact, it is critical that we use their resources efficiently. In this paper we study how to discover the optimal placement of virtual network functions in large scale data centers. We propose a novel parallel metaheuristic, fast heuristic objective functions of the QoS and new memory efficient data structures for large networks. We further identify a simple, fast heuristic that can produce competitive solutions to very large problem instances. Using these new concepts, we are able to find high quality solutions for data centres with up to 64,000 servers.
Similar Papers
Availability-Aware VNF Placement and Request Routing in MEC-Enabled 5G Networks
Networking and Internet Architecture
Makes 5G networks faster and more reliable.
A Reinforced Evolution-Based Approach to Multi-Resource Load Balancing
Neural and Evolutionary Computing
Improves computer learning by copying nature.
Digital Twin-Empowered Deep Reinforcement Learning for Intelligent VNF Migration in Edge-Core Networks
Networking and Internet Architecture
Makes internet faster and uses less power.