TY - JOUR
T1 - Online parallelized service function chain orchestration in data center networks
AU - Sun, Gang
AU - Chen, Zhenrong
AU - Yu, Hongfang
AU - Du, Xiaojiang
AU - Guizani, Mohsen
N1 - Publisher Copyright:
© 2019 Institute of Electrical and Electronics Engineers Inc.. All rights reserved.
PY - 2019
Y1 - 2019
N2 - In recent years, much attention has been focused on deploying service function chains (SFCs), each of which is composed of a set of virtual network functions (VNFs) in a specified order. This is a promising approach for enabling cloud service providers to deploy user service requests more flexibly while saving costs. However, less effort has been directed toward meeting heterogeneous needs, such as high throughput or low latency of user service requests with heterogeneous bandwidth demands, especially in data center networks (DCNs). In this paper, we propose an efficient orchestration algorithm for online SFC requests. It first splits a large flow into a number of subflows and replicates the same number of sub-SFCs. Each subflow is redirected to one of these ‘‘parallelized’’ sub-SFCs, which is termed a sub-user request. Then, each sub-user request is deployed based on a worst-fit strategy, and VNFs in the same SFC are instantiated on the same server to the greatest possible extent. Our algorithm is expected to enable network load balancing, reducing the delay experienced by small flows while improving the acceptance ratio for user requests. Finally, the simulation results show that the proposed algorithm outperforms other comparable algorithms.
AB - In recent years, much attention has been focused on deploying service function chains (SFCs), each of which is composed of a set of virtual network functions (VNFs) in a specified order. This is a promising approach for enabling cloud service providers to deploy user service requests more flexibly while saving costs. However, less effort has been directed toward meeting heterogeneous needs, such as high throughput or low latency of user service requests with heterogeneous bandwidth demands, especially in data center networks (DCNs). In this paper, we propose an efficient orchestration algorithm for online SFC requests. It first splits a large flow into a number of subflows and replicates the same number of sub-SFCs. Each subflow is redirected to one of these ‘‘parallelized’’ sub-SFCs, which is termed a sub-user request. Then, each sub-user request is deployed based on a worst-fit strategy, and VNFs in the same SFC are instantiated on the same server to the greatest possible extent. Our algorithm is expected to enable network load balancing, reducing the delay experienced by small flows while improving the acceptance ratio for user requests. Finally, the simulation results show that the proposed algorithm outperforms other comparable algorithms.
KW - Data center network
KW - Load balancing
KW - Orchestration
KW - Service function chain
KW - Splitting
UR - http://www.scopus.com/inward/record.url?scp=85077950837&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=85077950837&partnerID=8YFLogxK
U2 - 10.1109/ACCESS.2019.2930295
DO - 10.1109/ACCESS.2019.2930295
M3 - Article
AN - SCOPUS:85077950837
VL - 7
SP - 100147
EP - 100161
JO - IEEE Access
JF - IEEE Access
M1 - 8768289
ER -