arrow
Return

Queue-Aware Service Orchestration and Adaptive Parallel Traffic Scheduling Optimization in SDNFV-Enabled Cloud Computing

delete2023-10-01
delete1
PRE
AI
陈佳 (Jia Chen) *
J
Jing Chen *
K
Kuo Guo
DOI:10.1109/TCC.2023.3294239delete
deleteOriginal
deleteOriginal request for help
deleteShare
deleteSave
Abstract

Abstract

En 中文
Owing to software defined network function virtualization (SDNFV), network services can be implemented as service function chains (SFCs) in SDNFV-enabled Cloud Computing. SFCs consist of a series of ordered virtual network functions (VNFs). Due to the dynamic of underlying network state and the unpredictability of network traffic, the traditional SFC orchestrating (SFCO) approaches based on centralized placement and single-path routing lead to low availability of network resources, making it difficult to effectively manage and utilize complex and heterogeneous network resources. To address the above challenges, we propose a queue-aware SFCs orchestrating and adaptive parallel traffic scheduling optimization approach. First, the SFCO problem is modeled as a stochastic optimization problem, and the Lyapunov optimization theory is used to transform and decompose the SFCO problem to decouple the time coupling of optimal decision-making. An automatic decentralized algorithm based on queue model is proposed to orchestrate SFCs using information of local and its immediate one-hop neighbors. Furthermore, an adaptive parallel traffic scheduling optimization algorithm based on deep reinforcement learning is proposed, according to the decision output of the distributed SFC algorithm and current network state, network traffic is allocated to multiple paths for parallel transmission, which improves the availability of network resources and network performance. Experimental results show that, compared with the benchmarks, the average queue depth of the designed approach is reduced by 42.18%similar to 69.97% , the average cost of the designed approach is reduced by 16.1%similar to 55.6% , the average throughput is improved by 2.41%similar to 10.07% , the average link resource utilization rate is improved by about 6.9%similar to 28.3% , the average round-trip delay is shortened by 17.1%similar to 24.1% , and the average packet loss rate is reduced by 39.4%similar to 51.7% .
Keywords:
Cloud computing
Optimization
Costs
Delays
Quality of service
Dynamic scheduling
Couplings
Service function chain
orchestration
multi-path
Lyapunov optimization
deep reinforcement learning

Journal

I
IEEE Transactions on Cloud Computing
IF:
5
Papers:
1.8K
Citations:
4.3K

Organization

T
tsinghua university
Scholars:
11.8W
Papers: 10.0W
Citations: 137
B
Beijing Jiaotong University
Scholars:
2.2W
Papers: 1.7W
Citations: 1.2W