Scalable and cost-efficient algorithms for VNF chaining and placement problem

Selma Khebbache (1, 2, 3) , Makhlouf Hadji , Djamal Zeghlache (4, 1, 2, 3)

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

This paper focuses on placement and chaining of virtualized network functions (VNFs) in Network Function Virtualization Infrastructures (NFVI) for emerging software networks serving multiple tenants. Tenants can request network services to the NFVI in the form of service function chains (in the IETF SFC sense) or VNF Forwarding Graphs (VNF-FG in the case of ETSI) in support of their applications and business. This paper presents efficient algorithms to provide solutions to this NP-Hard chain placement problem to support NFVI providers. Cost-efficient and improved scalability multi-stage graph and 2-Factor algorithms are presented and shown to find near-optimal solutions in few seconds for large instances

Mots clés: 2-factor algorithm; NFVI providers; NP-hard chain placement problem; ETSI; VNF-FG; VNF forwarding graphs; IETF-SFC; VNF chaining-and-placement problem; Near-optimal solutions; Cost-efficient improved scalability multistage graph algorithm; Service function chains; Network service request; Software networks; Network function virtualization infrastructures; Virtualized network functions; NFV; SFC; Placement; Optimization; Middlebox

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

Selma Khebbache, Makhlouf Hadji, Djamal Zeghlache. Scalable and cost-efficient algorithms for VNF chaining and placement problem. ICIN 2017 : 20th Conference on Innovations in Clouds, Internet and Networks, Mar 2017, Paris, France. pp.92 - 99, ⟨10.1109/ICIN.2017.7899395⟩. ⟨hal-01630011⟩