GCMD: Genetic Correlation Multi-Domain Virtual Network Embedding Algorithm

18Citations
Citations of this article
11Readers
Mendeley users who have this article in their library.

This article is free to access.

Abstract

With the increase of network scale and the complexity of network structure, the problems of traditional Internet have emerged. At the same time, the appearance of network function virtualization (NFV) and network virtualization technologies has largely solved this problem, they can effectively split the network according to the application requirements, and flexibly provide network functions when needed. During the development of virtual network, how to improve network performance, including reducing the cost of embedding process and shortening the embedding time, has been widely concerned by the academia. Combining genetic algorithm with virtual network embedding problem, this paper proposes a genetic correlation multi-domain virtual network embedding algorithm (GCMD-VNE). The algorithm improves the natural selection stage and crossover stage of genetic algorithm, adds more accurate selection formula and crossover conditions, and improves the performance of the algorithm. Simulation results show that, compared with the existing algorithms, the algorithm has better performance in terms of embedding cost and embedding time.

Cite

CITATION STYLE

APA

Zhang, P., Pang, X., Kibalya, G., Kumar, N., He, S., & Zhao, B. (2021). GCMD: Genetic Correlation Multi-Domain Virtual Network Embedding Algorithm. IEEE Access, 9, 67167–67175. https://doi.org/10.1109/ACCESS.2021.3076916

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free