Routing-Led Evolutionary Algorithm for Large-Scale Multi-Objective VNF Placement Problems
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.
Code (0)
등록된 구현이 없습니다.
Similar Papers 제목 키워드 기반
On the Transferability of Knowledge among Vehicle Routing Problems by using Cellular Evolutionary Multitasking
Multitasking optimization is a recently introduced paradigm, focused on the simultaneous solving of multiple optimization problem instances (tasks). The goal of multitasking environments is to dynamically exploit existin…
Multifactorial Evolutionary Algorithm For Clustered Minimum Routing Cost Problem
Minimum Routing Cost Clustered Tree Problem (CluMRCT) is applied in various fields in both theory and application. Because the CluMRCT is NP-Hard, the approximate approaches are suitable to find the solution for this pro…
validAccelerating Vehicle Routing via AI-Initialized Genetic Algorithms
Vehicle Routing Problems (VRP) are an extension of the Traveling Salesperson Problem and are a fundamental NP-hard challenge in combinatorial optimization. Solving VRP in real-time at large scale has become critical in n…
Combinatorial Optimizationreinforcement-learningReinforcement LearningA reinforcement learning guided hybrid evolutionary algorithm for the latency location routing problem
The latency location routing problem integrates the facility location problem and the multi-depot cumulative capacitated vehicle routing problem. This problem involves making simultaneous decisions about depot locations …
Diversityreinforcement-learningReinforcement LearningFast energy-aware OLSR routing in VANETs by means of a parallel evolutionary algorithm
This work tackles the problem of reducing the power consumption of the OLSR routing protocol in vehicular networks. Nowadays, energy-aware and green communication protocols are important research topics, specially when d…