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

Abstract : 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
Document type :
Conference papers
Complete list of metadatas

https://hal.archives-ouvertes.fr/hal-01630011
Contributor : Médiathèque Télécom Sudparis & Institut Mines-Télécom Business School <>
Submitted on : Tuesday, November 7, 2017 - 10:11:26 AM
Last modification on : Thursday, October 17, 2019 - 12:36:53 PM

Identifiers

Citation

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⟩

Share

Metrics

Record views

66