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

IF 1.5 4区 计算机科学 Q3 ENGINEERING, ELECTRICAL & ELECTRONIC IET Communications Pub Date : 2024-03-04 DOI:10.1049/cmu2.12740
Wanwei Huang, Haobin Tian, Xiaohui Zhang, Min Huang, Song Li, Yuhua Li
{"title":"An improved resource allocation method for mapping service function chains based on A3C","authors":"Wanwei Huang,&nbsp;Haobin Tian,&nbsp;Xiaohui Zhang,&nbsp;Min Huang,&nbsp;Song Li,&nbsp;Yuhua Li","doi":"10.1049/cmu2.12740","DOIUrl":null,"url":null,"abstract":"<p>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.</p>","PeriodicalId":55001,"journal":{"name":"IET Communications","volume":"18 5","pages":"333-343"},"PeriodicalIF":1.5000,"publicationDate":"2024-03-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://onlinelibrary.wiley.com/doi/epdf/10.1049/cmu2.12740","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"IET Communications","FirstCategoryId":"94","ListUrlMain":"https://onlinelibrary.wiley.com/doi/10.1049/cmu2.12740","RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q3","JCRName":"ENGINEERING, ELECTRICAL & ELECTRONIC","Score":null,"Total":0}
引用次数: 0

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.

Abstract Image

查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
基于 A3C 的用于映射服务功能链的改进型资源分配方法
网络功能虚拟化(NFV)技术将网络功能作为软件功能部署在通用硬件平台上,以服务功能链(SFC)的形式提供定制化网络服务,提高了网络服务的灵活性和可扩展性,降低了网络服务成本。然而,在服务功能链映射过程中,资源分配不合理会造成资源利用率低、服务请求处理时间长、映射速率低等问题。针对服务映射资源分配不合理的问题,提出了一种基于异步优势行动评估算法(A3C)的改进型服务功能链映射资源分配方法(SA3C)。本研究提出了 SFC 映射模型和联合分配数学模型,将处理时间最小化建模为马尔可夫过程。利用三元深度强化学习算法 A3C 训练了主网络,并并行生成了多个子网络,目的是确定最优资源分配策略。实验仿真结果表明,与行为批判法(AC)和策略梯度法(PG)相比,SA3C 算法通过合理分配节点计算资源和链路带宽通信资源,可提高资源利用率 9.85%,减少总处理时间 10.72%,提高映射率 6.72%。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
IET Communications
IET Communications 工程技术-工程:电子与电气
CiteScore
4.30
自引率
6.20%
发文量
220
审稿时长
5.9 months
期刊介绍: IET Communications covers the fundamental and generic research for a better understanding of communication technologies to harness the signals for better performing communication systems using various wired and/or wireless media. This Journal is particularly interested in research papers reporting novel solutions to the dominating problems of noise, interference, timing and errors for reduction systems deficiencies such as wasting scarce resources such as spectra, energy and bandwidth. Topics include, but are not limited to: Coding and Communication Theory; Modulation and Signal Design; Wired, Wireless and Optical Communication; Communication System Special Issues. Current Call for Papers: Cognitive and AI-enabled Wireless and Mobile - https://digital-library.theiet.org/files/IET_COM_CFP_CAWM.pdf UAV-Enabled Mobile Edge Computing - https://digital-library.theiet.org/files/IET_COM_CFP_UAV.pdf
期刊最新文献
A deep learning-based approach for pseudo-satellite positioning Analysis of interference effect in VL-NOMA network considering signal power parameters performance An innovative model for an enhanced dual intrusion detection system using LZ-JC-DBSCAN, EPRC-RPOA and EG-GELU-GRU A high-precision timing and frequency synchronization algorithm for multi-h CPM signals Dual-user joint sensing and communications with time-divisioned bi-static radar
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1