We found a match
Your institution may have access to this item. Find your institution then sign in to continue.
- Title
An improved resource allocation method for mapping service function chains based on A3C.
- Authors
Huang, Wanwei; Tian, Haobin; Zhang, Xiaohui; Huang, Min; Li, Song; Li, Yuhua
- Abstract
Network function virtualization (NFV) technology deploys network functions as software functions on a generalised hardware platform and provides customised network services in the form of service function chain (SFC), which improves the flexibility and scalability of network services and reduces network service costs. However, irrational resource allocation during service function chain mapping will cause problems such as low resource utilisation, long service request processing time and low mapping rate. To address the unreasonable problem of service mapping resource allocation, an improved service function chain mapping resource allocation method (SA3C) based on the Asynchronous advantageous action evaluation algorithm (A3C) is proposed. This study proposes an SFC mapping model and a mathematical model for joint allocation, which modeled the minimization of processing time as a Markov process. The main network was trained and multiple sub‐networks were generated in parallel using the ternary and deep reinforcement learning algorithm A3C, with the goal of identifying the optimal resource allocation strategy. The experimental simulation results show that compared with the Actor‐Critic (AC) and Policy Gradient (PG) methods, SA3C algorithm can improve the resource utilisation by 9.85%, reduce the total processing time by 10.72%, and improve the mapping rate by 6.72%, by reasonably allocating node computational resources and link bandwidth communication resources.
- Subjects
REINFORCEMENT learning; DEEP reinforcement learning; BANDWIDTH allocation; RESOURCE allocation; MACHINE learning; MATHEMATICAL mappings
- Publication
IET Communications (Wiley-Blackwell), 2024, Vol 18, Issue 5, p333
- ISSN
1751-8628
- Publication type
Article
- DOI
10.1049/cmu2.12740