Dynamic Routing and Wavelength Assignment with Reinforcement Learning

Peyman Kafaei, Quentin Cappart, Nicolas Chapados, H. Pouya, Louis-Martin Rousseau
{"title":"Dynamic Routing and Wavelength Assignment with Reinforcement Learning","authors":"Peyman Kafaei, Quentin Cappart, Nicolas Chapados, H. Pouya, Louis-Martin Rousseau","doi":"10.1287/ijoo.2023.0092","DOIUrl":null,"url":null,"abstract":"With the rapid developments in communication systems, and considering their dynamic nature, all-optical networks are becoming increasingly complex. This study proposes a novel method based on deep reinforcement learning for the routing and wavelength assignment problem in all-optical wavelength-decision-multiplexing networks. We consider dynamic incoming requests, in which their arrival and holding times are not known in advance. The objective is to devise a strategy that minimizes the number of rejected packages due to the lack of resources in the long term. We use graph neural networks to capture crucial latent information from the graph-structured input to develop the optimal strategy. The proposed deep reinforcement learning algorithm selects a route and a wavelength simultaneously for each incoming traffic connection as they arrive. The results demonstrate that the learned agent outperforms the methods used in practice and can be generalized on network topologies that did not participate in training.","PeriodicalId":73382,"journal":{"name":"INFORMS journal on optimization","volume":" ","pages":""},"PeriodicalIF":0.0000,"publicationDate":"2023-06-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"INFORMS journal on optimization","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1287/ijoo.2023.0092","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

Abstract

With the rapid developments in communication systems, and considering their dynamic nature, all-optical networks are becoming increasingly complex. This study proposes a novel method based on deep reinforcement learning for the routing and wavelength assignment problem in all-optical wavelength-decision-multiplexing networks. We consider dynamic incoming requests, in which their arrival and holding times are not known in advance. The objective is to devise a strategy that minimizes the number of rejected packages due to the lack of resources in the long term. We use graph neural networks to capture crucial latent information from the graph-structured input to develop the optimal strategy. The proposed deep reinforcement learning algorithm selects a route and a wavelength simultaneously for each incoming traffic connection as they arrive. The results demonstrate that the learned agent outperforms the methods used in practice and can be generalized on network topologies that did not participate in training.
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
基于强化学习的动态路由和波长分配
随着通信系统的快速发展,考虑到其动态特性,全光网络变得越来越复杂。提出了一种基于深度强化学习的全光波长决策复用网络路由和波长分配问题的新方法。我们考虑动态传入请求,其中它们的到达和保持时间是未知的。目标是设计一种策略,以尽量减少由于长期缺乏资源而被拒绝的包的数量。我们使用图神经网络从图结构输入中捕获关键的潜在信息,以制定最优策略。提出的深度强化学习算法在每个进入的流量连接到达时同时选择路由和波长。结果表明,学习后的智能体优于实践中使用的方法,可以在未参与训练的网络拓扑上进行泛化。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
A Stochastic Inexact Sequential Quadratic Optimization Algorithm for Nonlinear Equality-Constrained Optimization Scenario-Based Robust Optimization for Two-Stage Decision Making Under Binary Uncertainty On the Hardness of Learning from Censored and Nonstationary Demand Temporal Bin Packing with Half-Capacity Jobs Editorial Board
×
引用
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