Skip to Main content Skip to Navigation
Preprints, Working Papers, ...

On a Virtual Network Function Placement and Routing problem: properties and formulations

Abstract : In recent years, the increasing diffusion of applications, both on computers and mobile devices, has yielded to an increasing demand for network services. So far, the network services, such as firewalls or tunneling, were provided by expensive hardware appliances, which could not keep up with the ever increasing demand nor allow new services to be embedded at a reasonable cost. Network Functions Virtualization has been recently proposed to overcome such issues: hardware appliances are replaced with Virtual Network Functions running on generic servers. Indeed, thanks to the Network Functions Virtualization paradigm, it is possible to flexibly, dynamically and cost-effectively manage network services. A key problem in implementing the Network Functions Virtualization paradigm is the so called Virtual Network Functions chaining problem: Virtual Network Function instances must be located on some network nodes. Demands must be routed so as to guarantee that each demand passes through the functions it requires. In this work we consider a particular case of the VNF chaining problem where each demand requires a single service and must be routed on a simple path. All the demands require the same service. Links and service instances are capacitated. The goal is to minimize the number of VNF instances installed. We investigate the problem properties and we compare two formulations inspired by the two main modeling strategies proposed in the literature.
Document type :
Preprints, Working Papers, ...
Complete list of metadatas
Contributor : Bernardetta Addis <>
Submitted on : Friday, November 23, 2018 - 4:21:28 PM
Last modification on : Tuesday, August 13, 2019 - 11:10:03 AM


Files produced by the author(s)


  • HAL Id : halshs-01643064, version 2



Bernardetta Addis, Giuliana Carello, Francesca de Bettin, Meihui Gao. On a Virtual Network Function Placement and Routing problem: properties and formulations. 2018. ⟨halshs-01643064v2⟩



Record views


Files downloads