Virtual Network Functions Placement and Routing Optimization

Abstract : Network Functions Virtualization (NFV) is incrementally deployed by Internet Service Providers (ISPs) in their carrier networks, by means of Virtual Network Function (VNF) chains, to address customers' demands. The motivation is the increasing manageability, reliability and performance of NFV systems, the gains in energy and space granted by virtualization, at a cost that becomes competitive with respect to legacy physical network function nodes. From a network optimization perspective, the routing of VNF chains across a carrier network implies key novelties making the VNF chain routing problem unique with respect to the state of the art: the bitrate of each demand flow can change along a VNF chain, the VNF processing latency and computing load can be a function of the demands traffic, VNFs can be shared among demands, etc. In this paper, we provide an NFV network model suitable for ISP operations. We define the generic VNF chain routing optimization problem and devise a mixed integer linear programming formulation. By extensive simulation on realistic ISP topologies, we draw conclusions on the trade-offs achievable between legacy Traffic Engineering (TE) ISP goals and novel combined TE-NFV goals.
Complete list of metadatas
Contributor : Bernardetta Addis <>
Submitted on : Wednesday, July 1, 2015 - 6:08:08 PM
Last modification on : Sunday, November 17, 2019 - 3:20:02 PM
Long-term archiving on: Tuesday, April 25, 2017 - 9:11:11 PM


Files produced by the author(s)




  • HAL Id : hal-01170042, version 1


Bernardetta Addis, Dallal Belabed, Mathieu Bouet, Stefano Secci. Virtual Network Functions Placement and Routing Optimization. 2015. ⟨hal-01170042v1⟩



Record views


Files downloads