z-logo
Premium
ILP‐based heuristics for a virtual network function placement and routing problem
Author(s) -
Addis Bernardetta,
Carello Giuliana,
Gao Meihui
Publication year - 2021
Publication title -
networks
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.977
H-Index - 64
eISSN - 1097-0037
pISSN - 0028-3045
DOI - 10.1002/net.22073
Subject(s) - heuristics , computer science , routing (electronic design automation) , virtual network , network topology , distributed computing , function (biology) , the internet , field (mathematics) , mathematical optimization , computer network , mathematics , pure mathematics , evolutionary biology , world wide web , biology , operating system
Thanks to the increased availability of computing capabilities in data centers, the recently proposed virtual network function paradigm can be used to keep up with the increasing demand for network services as internet and its applications grow. The problem arises then of managing the virtual network functions, that is, to decide where to instantiate the functions and how to route the demands to reach them. While it arises in an application field, the Virtual Network Function placement and routing problem combines location and routing aspects in an interesting, challenging problem. In this paper, we propose several ILP‐based heuristics and compare them on a dataset that includes instances with different sizes, network topologies, and service capacity. The heuristics prove effective in tackling even large size instances, with up to 50 nodes and more than 80 arcs.

This content is not available in your region!

Continue researching here.

Having issues? You can contact us here