Paper Info
Title
Service Function Chaining and Embedding with Spanning Closed Walk
Abstract
Network Function Virtualization (NFV) takes advantages of the emerging technologies in virtualization and automation to offer new ways in design, deployment, and management of networking services. In NFV, the proprietary hardware-based network functions are replaced by the software-based modules named as Virtual Network Functions (VNFs) or Service Functions (SFs). A network service request from the customer can be formed by multiple SFs. To satisfy a network service request, the service provider has to chain the SFs in the request into a Service Function Chain (SFC) and embed the constructed SFC onto the shared substrate network. In this paper, we comprehensively study how to composite and embed an SFC onto a shared substrate network with unique service function. We formulate this problem with the Integer Linear Programming (ILP) technique. We also propose an efficient heuristic algorithm with 2-approximation boundary, namely, Spanning Closed Walk based SFC Embedding (SCW-SFCE). Our extensive simulations and analysis show that the proposed approach can achieve near-optimal performance in a small network and outperform the Nearest Neighbour (NN) algorithm.
Year
DOI
Venue
2019
10.1109/HPSR.2019.8808131
2019 IEEE 20th International Conference on High Performance Switching and Routing (HPSR)
Keywords
Field
DocType
Network Function Virtualization,Virtual Network Function Deployment,Approximation Algorithm
Virtualization,Network service,Virtual network,Approximation algorithm,Chaining,Heuristic (computer science),Computer science,Computer network,Service provider,Integer programming
Conference
ISSN
ISBN
Citations 
2325-5595
978-1-7281-1687-7
0
PageRank 
References 
Authors
0.34
6
6
Name
Order
Citations
PageRank
Danyang Zheng1123.91
Chengzong Peng2184.01
Xueting Liao322.07
Guangchun Luo421225.81
Ling Tian5234.54
Xiaojun Cao653074.55