A bandwidth allocation scheme based on GRU traffic prediction in passive optical networks

IF 2.2 3区 物理与天体物理 Q2 OPTICS Optics Communications Pub Date : 2024-10-16 DOI:10.1016/j.optcom.2024.131222
Shiwen Song , Qinghua Tian , Xiao Zhang , Xiangjun Xin , Fu Wang , Dandan Sun , Xiongyan Tang , Lei Zhu , Feng Tian , Sitong Zhou , Qi Zhang
{"title":"A bandwidth allocation scheme based on GRU traffic prediction in passive optical networks","authors":"Shiwen Song ,&nbsp;Qinghua Tian ,&nbsp;Xiao Zhang ,&nbsp;Xiangjun Xin ,&nbsp;Fu Wang ,&nbsp;Dandan Sun ,&nbsp;Xiongyan Tang ,&nbsp;Lei Zhu ,&nbsp;Feng Tian ,&nbsp;Sitong Zhou ,&nbsp;Qi Zhang","doi":"10.1016/j.optcom.2024.131222","DOIUrl":null,"url":null,"abstract":"<div><div>With the advancement of information technology, network slicing technology has emerged as a viable solution for ensuring Quality of Service (QoS) in optical access networks. Current research is increasingly focusing on the integration of optical access networks with network slicing technologies. This paper proposes a bandwidth allocation scheme based on traffic prediction, specifically designed for resource management in optical network slicing scenarios. The scheme employs a Gated Recurrent Unit (GRU) neural network model to forecast future traffic, and combines bandwidth and latency factors to allocate bandwidth to each slice based on predicted values, thereby meeting the QoS requirements of various services. Simulation results indicate that, compared to the baseline algorithm, the proposed scheme achieved a 35.42% increase in Explaining Variance Score (EVS) and a 38.16% improvement in R2 score for factory slicing prediction. Similarly, for data center slicing prediction, the EVS score increased by 32.29% and the R2 score improved by 41.96%. In terms of performance metrics such as latency, packet loss rate, and throughput, the proposed algorithm outperforms both traditional prediction algorithms and the baseline algorithm.</div></div>","PeriodicalId":19586,"journal":{"name":"Optics Communications","volume":null,"pages":null},"PeriodicalIF":2.2000,"publicationDate":"2024-10-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Optics Communications","FirstCategoryId":"101","ListUrlMain":"https://www.sciencedirect.com/science/article/pii/S0030401824009593","RegionNum":3,"RegionCategory":"物理与天体物理","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q2","JCRName":"OPTICS","Score":null,"Total":0}
引用次数: 0

Abstract

With the advancement of information technology, network slicing technology has emerged as a viable solution for ensuring Quality of Service (QoS) in optical access networks. Current research is increasingly focusing on the integration of optical access networks with network slicing technologies. This paper proposes a bandwidth allocation scheme based on traffic prediction, specifically designed for resource management in optical network slicing scenarios. The scheme employs a Gated Recurrent Unit (GRU) neural network model to forecast future traffic, and combines bandwidth and latency factors to allocate bandwidth to each slice based on predicted values, thereby meeting the QoS requirements of various services. Simulation results indicate that, compared to the baseline algorithm, the proposed scheme achieved a 35.42% increase in Explaining Variance Score (EVS) and a 38.16% improvement in R2 score for factory slicing prediction. Similarly, for data center slicing prediction, the EVS score increased by 32.29% and the R2 score improved by 41.96%. In terms of performance metrics such as latency, packet loss rate, and throughput, the proposed algorithm outperforms both traditional prediction algorithms and the baseline algorithm.
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
无源光网络中基于 GRU 流量预测的带宽分配方案
随着信息技术的发展,网络切片技术已成为确保光接入网服务质量(QoS)的可行解决方案。目前的研究越来越关注光接入网络与网络切片技术的整合。本文提出了一种基于流量预测的带宽分配方案,专门用于光网络切片方案中的资源管理。该方案采用门控递归单元(GRU)神经网络模型预测未来流量,并结合带宽和延迟因素,根据预测值为每个切片分配带宽,从而满足各种服务的 QoS 要求。仿真结果表明,与基线算法相比,在工厂切片预测方面,拟议方案的解释方差得分(EVS)提高了 35.42%,R2 得分提高了 38.16%。同样,在数据中心切片预测方面,EVS 得分提高了 32.29%,R2 得分提高了 41.96%。就延迟、丢包率和吞吐量等性能指标而言,所提出的算法优于传统预测算法和基线算法。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
Optics Communications
Optics Communications 物理-光学
CiteScore
5.10
自引率
8.30%
发文量
681
审稿时长
38 days
期刊介绍: Optics Communications invites original and timely contributions containing new results in various fields of optics and photonics. The journal considers theoretical and experimental research in areas ranging from the fundamental properties of light to technological applications. Topics covered include classical and quantum optics, optical physics and light-matter interactions, lasers, imaging, guided-wave optics and optical information processing. Manuscripts should offer clear evidence of novelty and significance. Papers concentrating on mathematical and computational issues, with limited connection to optics, are not suitable for publication in the Journal. Similarly, small technical advances, or papers concerned only with engineering applications or issues of materials science fall outside the journal scope.
期刊最新文献
Photonic physically unclonable functions using randomly positioned aluminum nanoholes Lamellar beam with similar propagation and imaging characteristics to a Bessel beam Toward a fast and non-darkroom solution for speckle correlation based scattering imaging An improvement of optical PPM communication with high security Terahertz refractive index control of 3D printing materials by UV exposure
×
引用
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