A green VNFs placement and chaining algorithm

Oussama Soualah (1, 2, 3) , Marouen Mechtri (4) , Chaima Ghribi (1, 2, 3) , Djamal Zeghlache (5, 1, 2, 3)

1 SAMOVAR - Services répartis, Architectures, MOdélisation, Validation, Administration des Réseaux
2 TSP - RS2M - Département Réseaux et Services Multimédia Mobiles
3 CNRS - Centre National de la Recherche Scientifique
4 Orange Labs [Paris]
5 R3S-SAMOVAR - Réseaux, Systèmes, Services, Sécurité

This paper proposes an Integer Linear Program (ILP) to address Virtualized Network Function Forwarding Graph (VNF-FG) placement and chaining with Virtualized Network Functions (VNFs) shared across tenants to optimize resource usage and increase provider revenue. The proposed algorithm selects a limited number of candidate hosts from the infrastructure to reduce the complexity of the ILP and scale with problem size. Results from extensive simulations report performance improvements in terms of rejection rate, energy consumption and scalability. Limiting the number of candidates is an efficient heuristic to ensure scalability

Mots clés: Integer linear program; VNF-FG placement and chaining; Energy efficiency; NFV

Domaines: Réseaux et télécommunications [cs.NI]

Oussama Soualah, Marouen Mechtri, Chaima Ghribi, Djamal Zeghlache. A green VNFs placement and chaining algorithm. NOMS 2018 : IEEE/IFIP Network Operations and Management Symposium, Apr 2018, Taipei, Taiwan. pp.1 - 5, ⟨10.1109/NOMS.2018.8406183⟩. ⟨hal-01868941⟩