원문정보
초록
영어
Network function virtualization (NFV) virtualizes entire classes of network functions into building blocks of software. A virtualized network function (VNF) can consist of one or more virtual machines to provide communication services. Service Function Chaining (SFC) provides the ability to define an ordered list of virtualized network functions while considering multiple computing constraint conditions such as CPU, memory, and bandwidth. In a cloud data center network, the various virtualized network functions can reside in multiple physical machines and a certain chain of VNFs must be carefully considered to provide an optimal path. Such an optimization problem with multiple constraints is known as an NP-hard optimization problem. We propose a metaheuristic method to provide an optimal chain of VNFs using a genetic algorithm while considering multiple constraints. This paper aims to provide a path with well-balanced computing resources in a cloud data center network environment.
목차
1. Introduction
2. Structure and Operation Processes of Service Function Chaining
3. Genetic Algorithm
3.1. Initial Population Configuration and Fitness Measurement
3.2. Selection
3.3. Crossover
3.4. Mutation
4. Results and Discussion
4.1. Experiment Environment
4.2. Performance Measurement and Analysis
5. Conclusion
Acknowledgement
References