Scalable and cost-efficient algorithms for VNF chaining and placement problem
Résumé
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