返回
Robust deadline-aware network function parallelization framework under demand uncertainty
DOI:10.1016/j.knosys.2024.112696.png)
摘要
En 中文
The orchestration of Service Function Chains (SFCs) in Mobile Edge Computing (MEC) becomes crucial for ensuring efficient service provision, especially under dynamic and uncertain demand. Meanwhile, the parallelization of Virtual Network Functions (VNFs) within an SFC can further optimize resource usage and reduce the risk of deadline violations. However, most existing works formulate the SFC orchestration problem in MEC with deterministic demands and costly runtime resource reprovisioning to handle dynamic demands. This paper introduces a Robust Deadline-aware network function Parallelization framework under Demand Uncertainty (RDPDU) designed to address the challenges posed by unpredictable fluctuations in user demand and resource availability within MEC networks. RDPDU to consider end-to-end latency for SFC assembly by modeling load- dependent processing latency and load-independent propagation latency. Also, RDPDU formulates the problem assuming uncertain demand by Quadratic Integer Programming (QIP) to be resistant to dynamic service demand fluctuations. By discovering dependencies between VNFs, the RDPDU effectively assembles multiple sub-SFCs instead of the original SFC. Finally, our framework uses Deep Reinforcement Learning (DRL) to assemble sub-SFCs with guaranteed latency and deadline. By integrating DRL into the SFC orchestration problem, the framework adapts to changing network conditions and demand patterns, improving the overall system's flexibility and robustness. Experimental evaluations show that the proposed framework can effectively deal with demand fluctuations, latency, deadline, and scalability and improve performance against recent algorithms.
Keyword:
Mobile edge computing
Network function parallelization
Service function chain
Demand uncertainty
Deep reinforcement learning
期刊
K
IF:
7.6
论文数:
1.2W
被引数:
4.5W
机构
引用论文
A Novel Adaptive Filtering for Cooperative Localization Under Compass Failure and Non-Gaussian Noise
Anonymous Flocking With Obstacle Avoidance via the Position of Obstacle Boundary Point通过障碍物边界点的位置进行避障的匿名蜂群
Overcoming Occlusions: Perception Task-Oriented Information Sharing in Connected and Autonomous Vehicles
IEEE NETWORK
IF6.3
Unconventional Split Aptamers Cleaved at Functionally Essential Sites Preserve Biorecognition Capability
ANALYTICAL CHEMISTRY
IF6.7

