Powered by OpenAIRE graph
Found an issue? Give us feedback
image/svg+xml art designer at PLoS, modified by Wikipedia users Nina, Beao, JakobVoss, and AnonMoos Open Access logo, converted into svg, designed by PLoS. This version with transparent background. http://commons.wikimedia.org/wiki/File:Open_Access_logo_PLoS_white.svg art designer at PLoS, modified by Wikipedia users Nina, Beao, JakobVoss, and AnonMoos http://www.plos.org/ https://doi.org/10.2...arrow_drop_down
image/svg+xml art designer at PLoS, modified by Wikipedia users Nina, Beao, JakobVoss, and AnonMoos Open Access logo, converted into svg, designed by PLoS. This version with transparent background. http://commons.wikimedia.org/wiki/File:Open_Access_logo_PLoS_white.svg art designer at PLoS, modified by Wikipedia users Nina, Beao, JakobVoss, and AnonMoos http://www.plos.org/
https://doi.org/10.21203/rs.3....
Article . 2023 . Peer-reviewed
License: CC BY
Data sources: Crossref
image/svg+xml art designer at PLoS, modified by Wikipedia users Nina, Beao, JakobVoss, and AnonMoos Open Access logo, converted into svg, designed by PLoS. This version with transparent background. http://commons.wikimedia.org/wiki/File:Open_Access_logo_PLoS_white.svg art designer at PLoS, modified by Wikipedia users Nina, Beao, JakobVoss, and AnonMoos http://www.plos.org/
IET Communications
Article . 2024 . Peer-reviewed
License: CC BY
Data sources: Crossref
image/svg+xml art designer at PLoS, modified by Wikipedia users Nina, Beao, JakobVoss, and AnonMoos Open Access logo, converted into svg, designed by PLoS. This version with transparent background. http://commons.wikimedia.org/wiki/File:Open_Access_logo_PLoS_white.svg art designer at PLoS, modified by Wikipedia users Nina, Beao, JakobVoss, and AnonMoos http://www.plos.org/
IET Communications
Article . 2024
Data sources: DOAJ
versions View all 3 versions
addClaim

This Research product is the result of merged Research products in OpenAIRE.

You have already added 0 works in your ORCID record related to the merged Research product.

An improved resource allocation method for mapping service function chains based on A3C

Authors: Wanwei Huang; Haobin Tian; Xiaohui Zhang; Min Huang; Song Li; Yuhua Li;

An improved resource allocation method for mapping service function chains based on A3C

Abstract

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, we proposes an improved service function chain mapping resource allocation method (SA3C) based on the Asynchronous advantageous action evaluation algorithm (A3C). Firstly, the SFC mapping model is established, the SFC mapping process is divided into two layers of physical topology resource layer and virtual network function request layer, and the two layers are represented by abstract parameters; Secondly, the relationship between mapping resource allocation and service processing process is analysed, and a mathematical model is established for the minimisation of the processing time of the joint allocation of node computation and link bandwidth communication resources, and the minimisation mathematical model is modelled as a Markov process, defining the ternary containing state, action, and reward; Finally, combining the ternary with the deep reinforcement learning algorithm A3C, using the training master network as a template, and using multi-threading technology to generate multiple sub-networks for parallel training to find 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.

Related Organizations
Keywords

deep reinforcement learning, service function chain, Telecommunication, network function virtualization, resource allocation, TK5101-6720, asynchronous advantageous action evaluation algorithm

  • BIP!
    Impact byBIP!
    selected citations
    These citations are derived from selected sources.
    This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).
    1
    popularity
    This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network.
    Average
    influence
    This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).
    Average
    impulse
    This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network.
    Average
Powered by OpenAIRE graph
Found an issue? Give us feedback
selected citations
These citations are derived from selected sources.
This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).
BIP!Citations provided by BIP!
popularity
This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network.
BIP!Popularity provided by BIP!
influence
This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).
BIP!Influence provided by BIP!
impulse
This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network.
BIP!Impulse provided by BIP!
1
Average
Average
Average
gold