基于深度强化学习的弹性光网络中可用性感知和延迟敏感的 RAN 切片映射

IF 4.7 2区 计算机科学 Q1 COMPUTER SCIENCE, INFORMATION SYSTEMS
Yunwu Wang;Lingxing Kong;Min Zhu;Jiahua Gu;Yuancheng Cai;Jiao Zhang
{"title":"基于深度强化学习的弹性光网络中可用性感知和延迟敏感的 RAN 切片映射","authors":"Yunwu Wang;Lingxing Kong;Min Zhu;Jiahua Gu;Yuancheng Cai;Jiao Zhang","doi":"10.1109/TNSM.2024.3440574","DOIUrl":null,"url":null,"abstract":"To ensure reliable network services, the link protection method is widely employed for light-path provision. However, it inevitably increases propagation delay due to different transmission distances between active and backup light-paths, leading to a longer transport delay. Consequently, a crucial challenge is how to coordinate link protection and transport delay to maximize service availability while satisfying the delay requirements of each service. In this paper, we investigate the availability-aware and delay-sensitive (AADS) radio access network (RAN) slicing mapping problem with link protection in metro-access/aggregation elastic optical networks (EONs). We initially provide the mathematical model of availability and propagation delay for both unprotected and protected RAN slicing requests. Subsequently, we propose a mixed-integer linear programming (MILP) model and a deep reinforcement learning (DRL)-based algorithm to maximize the availability of RAN requests while satisfying the specified delay requirements of each slice. Finally, we analyze the availability under various 5G services (i.e., enhanced Mobile Broadband, ultra-Reliable Low-Latency Communication, and massive Machine Type Communication) from a delay perspective in both small-scale and large-scale networks. Simulation results demonstrate that our proposed DRL-based method can achieve up to a 14.1% increase in availability compared to the benchmarks.","PeriodicalId":13423,"journal":{"name":"IEEE Transactions on Network and Service Management","volume":"21 6","pages":"6026-6040"},"PeriodicalIF":4.7000,"publicationDate":"2024-08-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Availability-Aware and Delay-Sensitive RAN Slicing Mapping Based on Deep Reinforcement Learning in Elastic Optical Networks\",\"authors\":\"Yunwu Wang;Lingxing Kong;Min Zhu;Jiahua Gu;Yuancheng Cai;Jiao Zhang\",\"doi\":\"10.1109/TNSM.2024.3440574\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"To ensure reliable network services, the link protection method is widely employed for light-path provision. However, it inevitably increases propagation delay due to different transmission distances between active and backup light-paths, leading to a longer transport delay. Consequently, a crucial challenge is how to coordinate link protection and transport delay to maximize service availability while satisfying the delay requirements of each service. In this paper, we investigate the availability-aware and delay-sensitive (AADS) radio access network (RAN) slicing mapping problem with link protection in metro-access/aggregation elastic optical networks (EONs). We initially provide the mathematical model of availability and propagation delay for both unprotected and protected RAN slicing requests. Subsequently, we propose a mixed-integer linear programming (MILP) model and a deep reinforcement learning (DRL)-based algorithm to maximize the availability of RAN requests while satisfying the specified delay requirements of each slice. Finally, we analyze the availability under various 5G services (i.e., enhanced Mobile Broadband, ultra-Reliable Low-Latency Communication, and massive Machine Type Communication) from a delay perspective in both small-scale and large-scale networks. Simulation results demonstrate that our proposed DRL-based method can achieve up to a 14.1% increase in availability compared to the benchmarks.\",\"PeriodicalId\":13423,\"journal\":{\"name\":\"IEEE Transactions on Network and Service Management\",\"volume\":\"21 6\",\"pages\":\"6026-6040\"},\"PeriodicalIF\":4.7000,\"publicationDate\":\"2024-08-08\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"IEEE Transactions on Network and Service Management\",\"FirstCategoryId\":\"94\",\"ListUrlMain\":\"https://ieeexplore.ieee.org/document/10630702/\",\"RegionNum\":2,\"RegionCategory\":\"计算机科学\",\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q1\",\"JCRName\":\"COMPUTER SCIENCE, INFORMATION SYSTEMS\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"IEEE Transactions on Network and Service Management","FirstCategoryId":"94","ListUrlMain":"https://ieeexplore.ieee.org/document/10630702/","RegionNum":2,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q1","JCRName":"COMPUTER SCIENCE, INFORMATION SYSTEMS","Score":null,"Total":0}
引用次数: 0

摘要

为了保证网络服务的可靠性,光路配置普遍采用链路保护方式。然而,由于主从光路之间的传输距离不同,不可避免地增加了传输延迟,从而导致更长的传输延迟。因此,如何协调链路保护和传输延迟,以最大限度地提高服务可用性,同时满足每个业务的延迟要求是一个关键的挑战。本文研究了城域接入/汇聚弹性光网络(EONs)中具有链路保护的可用性感知和延迟敏感(AADS)无线接入网(RAN)切片映射问题。我们首先为无保护和受保护的RAN切片请求提供了可用性和传播延迟的数学模型。随后,我们提出了一种混合整数线性规划(MILP)模型和一种基于深度强化学习(DRL)的算法来最大化RAN请求的可用性,同时满足每个片的指定延迟要求。最后,我们从延迟的角度分析了各种5G服务(即增强型移动宽带、超可靠低延迟通信和大规模机器类型通信)在小规模和大规模网络中的可用性。仿真结果表明,与基准测试相比,我们提出的基于drl的方法可实现高达14.1%的可用性提高。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Availability-Aware and Delay-Sensitive RAN Slicing Mapping Based on Deep Reinforcement Learning in Elastic Optical Networks
To ensure reliable network services, the link protection method is widely employed for light-path provision. However, it inevitably increases propagation delay due to different transmission distances between active and backup light-paths, leading to a longer transport delay. Consequently, a crucial challenge is how to coordinate link protection and transport delay to maximize service availability while satisfying the delay requirements of each service. In this paper, we investigate the availability-aware and delay-sensitive (AADS) radio access network (RAN) slicing mapping problem with link protection in metro-access/aggregation elastic optical networks (EONs). We initially provide the mathematical model of availability and propagation delay for both unprotected and protected RAN slicing requests. Subsequently, we propose a mixed-integer linear programming (MILP) model and a deep reinforcement learning (DRL)-based algorithm to maximize the availability of RAN requests while satisfying the specified delay requirements of each slice. Finally, we analyze the availability under various 5G services (i.e., enhanced Mobile Broadband, ultra-Reliable Low-Latency Communication, and massive Machine Type Communication) from a delay perspective in both small-scale and large-scale networks. Simulation results demonstrate that our proposed DRL-based method can achieve up to a 14.1% increase in availability compared to the benchmarks.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
IEEE Transactions on Network and Service Management
IEEE Transactions on Network and Service Management Computer Science-Computer Networks and Communications
CiteScore
9.30
自引率
15.10%
发文量
325
期刊介绍: IEEE Transactions on Network and Service Management will publish (online only) peerreviewed archival quality papers that advance the state-of-the-art and practical applications of network and service management. Theoretical research contributions (presenting new concepts and techniques) and applied contributions (reporting on experiences and experiments with actual systems) will be encouraged. These transactions will focus on the key technical issues related to: Management Models, Architectures and Frameworks; Service Provisioning, Reliability and Quality Assurance; Management Functions; Enabling Technologies; Information and Communication Models; Policies; Applications and Case Studies; Emerging Technologies and Standards.
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信