A Stable Matching Based Algorithm to Minimize the End-to-End Latency of Edge NFV

摘要

In future wireless networks, network functions virtualization lays the foundations for establishing a new dynamic resource management framework to efficiently utilize network resources. The main problem discussed in the paper is to minimize the total latency for a network and how to do it efficiently. In this paper, a model of users, Virtual Network Functions (vNFs) and hosting devices has been taken, and it has been used to find the minimum latency using the Integer Linear Programming (ILP) which is an NP-hard problem and takes exponential time, but this is the optimal solution. We apply the stable matching based algorithm to solve the problem in polynomial time. From extensive performance evaluation, it is found that our proposed algorithm is very close to the optimal in terms of latency.