Provably Efficient Algorithms for Placement of Service Function Chains with Ordering Constraints

Andrea Tomassilli 1, 2 Frédéric Giroire 1, 2 Nicolas Huin 2 Stéphane Pérennes 2
2 COATI - Combinatorics, Optimization and Algorithms for Telecommunications
Laboratoire I3S - COMRED - COMmunications, Réseaux, systèmes Embarqués et Distribués, CRISAM - Inria Sophia Antipolis - Méditerranée
Abstract : A Service Function Chain (SFC) is an ordered sequence of network functions, such as load balancing, content filtering, and firewall. With the Network Function Virtualization (NFV) paradigm, network functions can be deployed as pieces of software on generic hardware, leading to a flexibility of network service composition. Along with its benefits, NFV brings several challenges to network operators, such as the placement of virtual network functions. In this paper, we study the problem of how to optimally place the network functions within the network in order to satisfy all the SFC requirements of the flows. Our optimization task is to minimize the total deployment cost. We show that the problem can be seen as an instance of the Set Cover Problem, even in the case of ordered sequences of network functions. It allows us to propose two logarithmic factor approximation algorithms which have the best possible asymp-totic factor. Further, we devise an optimal algorithm for tree topologies. Finally, we evaluate the performances of our proposed algorithms through extensive simulations. We demonstrate that near-optimal solutions can be found with our approach.
Type de document :
Communication dans un congrès
IEEE INFOCOM 2018 - IEEE Conference on Computer Communications, Apr 2018, Honolulu, United States. IEEE, 〈10.1109/INFOCOM.2018.8486275〉
Liste complète des métadonnées

https://hal.inria.fr/hal-01921112
Contributeur : Frédéric Giroire <>
Soumis le : mardi 13 novembre 2018 - 16:03:40
Dernière modification le : dimanche 25 novembre 2018 - 20:29:40

Fichier

2018-INFOCOM-sfc-approximation...
Fichiers produits par l'(les) auteur(s)

Identifiants

Collections

Citation

Andrea Tomassilli, Frédéric Giroire, Nicolas Huin, Stéphane Pérennes. Provably Efficient Algorithms for Placement of Service Function Chains with Ordering Constraints. IEEE INFOCOM 2018 - IEEE Conference on Computer Communications, Apr 2018, Honolulu, United States. IEEE, 〈10.1109/INFOCOM.2018.8486275〉. 〈hal-01921112〉

Partager

Métriques

Consultations de la notice

27

Téléchargements de fichiers

6