VNF-P: A model for efficient placement of virtualized network functions

TLDR

Network Functions Virtualization (NFV) virtualizes network functions into modular, chainable building blocks that enhance flexibility and scalability by allowing runtime allocation based on demand. This paper presents and evaluates a formal model for resource allocation of virtualized network functions, termed Virtual Network Function Placement (VNF‑P). The model addresses a hybrid scenario combining dedicated physical hardware and virtualized service instances, and is evaluated on a small service provider scenario with two service chain types to assess execution speed. The evaluation shows that the VNF‑P algorithms complete within 16 seconds or less, demonstrating feasibility for rapid response to changing demand.

Abstract

Network Functions Virtualization (NFV) is an upcoming paradigm where network functionality is virtualized and split up into multiple building blocks that can be chained together to provide the required functionality. This approach increases network flexibility and scalability as these building blocks can be allocated and reallocated at runtime depending on demand. The success of this approach depends on the existence and performance of algorithms that determine where, and how these building blocks are instantiated. In this paper, we present and evaluate a formal model for resource allocation of virtualized network functions within NFV environments, a problem we refer to as Virtual Network Function Placement (VNF-P). We focus on a hybrid scenario where part of the services may be provided by dedicated physical hardware, and where part of the services are provided using virtualized service instances. We evaluate the VNF-P model using a small service provider scenario and two types of service chains, and evaluate its execution speed. We find that the algorithms finish in 16 seconds or less for a small service provider scenario, making it feasible to react quickly to changing demand.