O-DQR: A Multi-Agent Deep Reinforcement Learning for Multihop Routing in Overlay Networks

IF 5.7 2区 计算机科学 Q1 COMPUTER SCIENCE, INFORMATION SYSTEMS IEEE Transactions on Network and Service Management Pub Date : 2024-10-23 DOI:10.1109/TNSM.2024.3485196
Redha A. Alliche;Ramón Aparicio Pardo;Lucile Sassatelli
{"title":"O-DQR: A Multi-Agent Deep Reinforcement Learning for Multihop Routing in Overlay Networks","authors":"Redha A. Alliche;Ramón Aparicio Pardo;Lucile Sassatelli","doi":"10.1109/TNSM.2024.3485196","DOIUrl":null,"url":null,"abstract":"This paper addresses the problem of dynamic packet routing in overlay networks using a fully decentralized Multi-Agent Deep Reinforcement Learning (MA-DRL). Overlay networks are built by having a virtual topology on top of an Internet Service Provider (ISP) underlay network, where those nodes are running a fixed, single path routing policy decided by the ISP. In such a scenario, the underlay topology and the traffic are unknown by the overlay network. In this setting, we propose O-DQR, which is an MA-DRL framework working under Distributed Training Decentralized Execution (DTDE), where the agents are allowed to communicate only with their immediate overlay neighbors during both training and inference. We address three fundamental aspects for deploying such a solution: (i) performance (delay, loss rate), where the framework can achieve near-optimal performance, (ii) control overhead, which is reduced by enabling the agents to send control packets only when needed dynamically; and (iii) training convergence stability, which is improved by proposing a guided reward mechanism for dynamically learning the penalty applied when a packet is lost. Finally, we evaluate our solution through extensive experimentation in a realistic network simulation in both offline training and continual learning settings.","PeriodicalId":13423,"journal":{"name":"IEEE Transactions on Network and Service Management","volume":"22 1","pages":"439-455"},"PeriodicalIF":5.7000,"publicationDate":"2024-10-23","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/10730787/","RegionNum":2,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q1","JCRName":"COMPUTER SCIENCE, INFORMATION SYSTEMS","Score":null,"Total":0}
引用次数: 0

Abstract

This paper addresses the problem of dynamic packet routing in overlay networks using a fully decentralized Multi-Agent Deep Reinforcement Learning (MA-DRL). Overlay networks are built by having a virtual topology on top of an Internet Service Provider (ISP) underlay network, where those nodes are running a fixed, single path routing policy decided by the ISP. In such a scenario, the underlay topology and the traffic are unknown by the overlay network. In this setting, we propose O-DQR, which is an MA-DRL framework working under Distributed Training Decentralized Execution (DTDE), where the agents are allowed to communicate only with their immediate overlay neighbors during both training and inference. We address three fundamental aspects for deploying such a solution: (i) performance (delay, loss rate), where the framework can achieve near-optimal performance, (ii) control overhead, which is reduced by enabling the agents to send control packets only when needed dynamically; and (iii) training convergence stability, which is improved by proposing a guided reward mechanism for dynamically learning the penalty applied when a packet is lost. Finally, we evaluate our solution through extensive experimentation in a realistic network simulation in both offline training and continual learning settings.
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
O-DQR:覆盖网络中多跳路由的多智能体深度强化学习
本文使用完全分散的多智能体深度强化学习(MA-DRL)解决了覆盖网络中的动态数据包路由问题。覆盖网络是通过在互联网服务提供商(ISP)底层网络上拥有一个虚拟拓扑来构建的,其中这些节点运行由ISP决定的固定的单路径路由策略。在这种情况下,覆盖网络不知道底层的拓扑结构和流量。在这种情况下,我们提出了O-DQR,这是一种工作在分布式训练分散执行(DTDE)下的MA-DRL框架,其中智能体在训练和推理期间只允许与其直接覆盖邻居通信。我们解决了部署这种解决方案的三个基本方面:(i)性能(延迟,损失率),框架可以实现近乎最佳的性能;(ii)控制开销,通过使代理仅在需要时动态发送控制数据包来减少控制开销;(iii)训练收敛稳定性,通过提出一种引导奖励机制来动态学习数据包丢失时所施加的惩罚,从而提高了收敛稳定性。最后,我们通过在离线训练和持续学习设置下的现实网络模拟中进行广泛的实验来评估我们的解决方案。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
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.
期刊最新文献
Entity-Level Autoregressive Relational Triple Extraction Toward Knowledge Graph Construction for Network Operation and Maintenance BiTrustChain: A Dual-Blockchain Empowered Dynamic Vehicle Trust Management for Malicious Detection in IoV A UAV-Aided Digital Twin Framework for IoT Networks With High Accuracy and Synchronization AI-Empowered Multivariate Probabilistic Forecasting: A Key Enabler for Sustainability in Open RAN Privacy-Preserving and Collusion-Resistant Data Query Scheme for Vehicular Platoons
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:604180095
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1