Paper Info
Title
Hybrid Service Chain Deployment in Networks with Unique Function
Abstract
In Network Function Virtualization (NFV), Service Function Chain (SFC) is composed of Virtual Network Function (VNF) nodes that are chained via VNF links. SFCs can be specified as unidirectional or bidirectional. A unidirectional SFC (u-SFC) demands the traffic being forwarded via the VNFs in one direction, while a bidirectional SFC (b-SFC) requires bidirectional traffic flows. In this paper, for the first time, we investigate the problem of how to efficiently deploy a hybrid SFC (h-SFC), whereas some VNF nodes are required to process bidirectional traffic while others only handle unidirectional traffic. We define a new problem called hybrid SFC Deployment (h-SFCD). When each substrate node provides one unique VNF, we prove the NP-hardness of the h-SFCD problem and propose an approximate algorithm, namely, 2-approximation Hybrid Service function chain Deployment in Unique function networks (2-HSDU). Our experimental results show that the proposed 2-HSD-U algorithm significantly outperforms the heuristic algorithm based on the traditional Nearest-Neighbor technique.
Year
DOI
Venue
2019
10.1109/ICC.2019.8761210
IEEE International Conference on Communications
Keywords
Field
DocType
Network function virtualization,Service function chain deployment,Hybrid traffic flows,Approximation algorithm
Virtual network,Software deployment,Computer science,Heuristic (computer science),Bidirectional traffic,Network Functions Virtualization,Computer network
Conference
ISSN
Citations 
PageRank 
1550-3607
0
0.34
References 
Authors
0
6
Name
Order
Citations
PageRank
Danyang Zheng1123.91
Chengzong Peng2184.01
Evrim Guler3104.34
Guangchun Luo421225.81
Ling Tian5348.67
Xiaojun Cao653074.55