# Optimal Orchestration of Virtual Network Functions

**Authors:** Meihui Gao (OPTIMIST), Bernardetta Addis (OPTIMIST), Mathieu Bouet,, Stefano Secci

arXiv: 1706.04762 · 2017-06-16

## TL;DR

This paper addresses the complex problem of optimally orchestrating Virtual Network Functions (VNFs) through a formal LP model and a scalable heuristic, balancing traffic engineering and infrastructure efficiency in NFV environments.

## Contribution

It introduces a novel LP formulation for VNF placement and routing, along with a scalable heuristic, advancing the state-of-the-art in NFV orchestration methods.

## Key findings

- The heuristic scales well with large network instances.
- Trade-offs between traffic engineering and NFV efficiency are characterized.
- The approach outperforms classical VNE in stability and proximity to optimal solutions.

## Abstract

-The emergence of Network Functions Virtualization (NFV) is bringing a set of novel algorithmic challenges in the operation of communication networks. NFV introduces volatility in the management of network functions, which can be dynamically orchestrated, i.e., placed, resized, etc. Virtual Network Functions (VNFs) can belong to VNF chains, where nodes in a chain can serve multiple demands coming from the network edges. In this paper, we formally define the VNF placement and routing (VNF-PR) problem, proposing a versatile linear programming formulation that is able to accommodate specific features and constraints of NFV infrastructures, and that is substantially different from existing virtual network embedding formulations in the state of the art. We also design a math-heuristic able to scale with multiple objectives and large instances. By extensive simulations, we draw conclusions on the trade-off achievable between classical traffic engineering (TE) and NFV infrastructure efficiency goals, evaluating both Internet access and Virtual Private Network (VPN) demands. We do also quantitatively compare the performance of our VNF-PR heuristic with the classical Virtual Network Embedding (VNE) approach proposed for NFV orchestration, showing the computational differences, and how our approach can provide a more stable and closer-to-optimum solution.

## Full text

_Full body text omitted from this summary view._ Fetch the complete paper as Markdown: https://tomesphere.com/paper/1706.04762/full.md

## Figures

16 figures with captions in the complete paper: https://tomesphere.com/paper/1706.04762/full.md

## References

36 references — full list in the complete paper: https://tomesphere.com/paper/1706.04762/full.md

---
Source: https://tomesphere.com/paper/1706.04762