A Quick Adaptive Migration Algorithm for Virtual Network Function

6Citations
Citations of this article
1Readers
Mendeley users who have this article in their library.
Get full text

Abstract

The combination of software defined network (SDN) and network function virtualization (NFV) solves some problems in traditional networks, such as service deployment and configuration and management of network resources. However, it also introduces new problems such as network load imbalance. Virtual network function (VNF) migration is an effective way to solve these problems. In this paper, we propose a quick adaptive migration algorithm for VNF, which combines pre-calculation and real-time calculation to reduce the cost of migration. When the node triggers the light-overload-threshold, we perform a pre-calculation of migration for the node and set the result-set. When the node is overloaded, we perform the migration if the result-set is unexpired, otherwise we perform the real-time migration solution. Simulation results show that this algorithm can effectively reduce the number of migration, improve the stability of the system and reduce the overall network migration overhead of the system.

Cite

CITATION STYLE

APA

Wang, Y., Zhu, X., & Qiu, X. (2019). A Quick Adaptive Migration Algorithm for Virtual Network Function. In Lecture Notes of the Institute for Computer Sciences, Social-Informatics and Telecommunications Engineering, LNICST (Vol. 281, pp. 333–347). Springer Verlag. https://doi.org/10.1007/978-3-030-19156-6_31

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