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

Karanbir Singh Ghai | Zendy; Salimur Choudhury | Zendy; Abdulsalam Yassine | Zendy

AI Assistant Blog Pricing

Home ZAIA Blog

Open Access

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

Author(s) -

Karanbir Singh Ghai,

Salimur Choudhury,

Abdulsalam Yassine

Publication year - 2019

Publication title -

procedia computer science

Language(s) - English

Resource type - Journals

SCImago Journal Rank - 0.334

H-Index - 76

ISSN - 1877-0509

DOI - 10.1016/j.procs.2019.04.052

Subject(s) - computer science , latency (audio) , integer programming , time complexity , network virtualization , network functions virtualization , virtual network , virtualization , algorithm , wireless network , matching (statistics) , distributed computing , end to end principle , linear programming , computer network , wireless , cloud computing , operating system , telecommunications , statistics , mathematics

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.

The content you want is available to Zendy users.

Already have an account? Click here to sign in.

Having issues? You can contact us here

Accelerating Research