基于分布式图强化学习的可扩展智能路由

IF 4.7 2区 计算机科学 Q1 COMPUTER SCIENCE, HARDWARE & ARCHITECTURE Computer Networks Pub Date : 2025-02-01 Epub Date: 2024-12-02 DOI:10.1016/j.comnet.2024.110915
Jing Zhang , Jianfeng Guan , Kexian Liu , Yizhong Hu , Ao Shen , Yuyin Ma
{"title":"基于分布式图强化学习的可扩展智能路由","authors":"Jing Zhang ,&nbsp;Jianfeng Guan ,&nbsp;Kexian Liu ,&nbsp;Yizhong Hu ,&nbsp;Ao Shen ,&nbsp;Yuyin Ma","doi":"10.1016/j.comnet.2024.110915","DOIUrl":null,"url":null,"abstract":"<div><div>Traditional routing typically relies on simpler performance metrics that can be derived directly through mathematical methods for decision-making, which often results in limited optimization outcomes. As future networks expand, along with the diversity of applications and traffic volume, the network environment grows increasingly complex. In contrast, Intelligent Routing (IR) that leverages machine learning methods can model more complex performance metrics, rendering it better suited to the intricate scenarios of future networks. The increasing complexity of networks also indicates that the workload associated with collecting routing information and executing decision calculations is growing exponentially. Compared to centralized IR, Distributed IR (DIR) distributes the computational load and interaction demands across multiple nodes, thereby offering enhanced scalability. However, DIR makes decisions based on local information, which limits global optimization. In this paper, we propose a novel Scalable Intelligent Routing based on Distributed Graph Reinforcement Learning, called ScaIR. ScaIR is a full y distributed multi-agent routing method. Each router is an independent agent based on local graph Reinforcement Learning (RL). Graph Neural Networks (GNN) are employed to extract global network characteristics which serve as input for RL, thereby enhancing global optimization. Especially, GNN here is also fully distributed. Each router has an independent sub-GNN determined by the adjacency relationships with its one-hop neighbors. Instead of entire network information and model parameters, each sub-GNN only iteratively interacts with its neighbors and computes a highly compressed Feature Vector (FV) representing the current network state, which greatly saves the computing and communication cost. We carried out extensive simulation experiments under multiple real network topologies of different scales. Simulation results show that ScaIR reduces forwarding time by more than 25% and achieves faster convergence. It can better adapt to congested, dynamic or unknown environments. Compared to other methods, it significantly reduces communication cost and computational time, and has better scalability. In addition, by changing the FV length of sub-GNNs, it is verified that GNN does play a key role in ScaIR.</div></div>","PeriodicalId":50637,"journal":{"name":"Computer Networks","volume":"257 ","pages":"Article 110915"},"PeriodicalIF":4.7000,"publicationDate":"2025-02-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"ScaIR: Scalable Intelligent Routing based on Distributed Graph Reinforcement Learning\",\"authors\":\"Jing Zhang ,&nbsp;Jianfeng Guan ,&nbsp;Kexian Liu ,&nbsp;Yizhong Hu ,&nbsp;Ao Shen ,&nbsp;Yuyin Ma\",\"doi\":\"10.1016/j.comnet.2024.110915\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"<div><div>Traditional routing typically relies on simpler performance metrics that can be derived directly through mathematical methods for decision-making, which often results in limited optimization outcomes. As future networks expand, along with the diversity of applications and traffic volume, the network environment grows increasingly complex. In contrast, Intelligent Routing (IR) that leverages machine learning methods can model more complex performance metrics, rendering it better suited to the intricate scenarios of future networks. The increasing complexity of networks also indicates that the workload associated with collecting routing information and executing decision calculations is growing exponentially. Compared to centralized IR, Distributed IR (DIR) distributes the computational load and interaction demands across multiple nodes, thereby offering enhanced scalability. However, DIR makes decisions based on local information, which limits global optimization. In this paper, we propose a novel Scalable Intelligent Routing based on Distributed Graph Reinforcement Learning, called ScaIR. ScaIR is a full y distributed multi-agent routing method. Each router is an independent agent based on local graph Reinforcement Learning (RL). Graph Neural Networks (GNN) are employed to extract global network characteristics which serve as input for RL, thereby enhancing global optimization. Especially, GNN here is also fully distributed. Each router has an independent sub-GNN determined by the adjacency relationships with its one-hop neighbors. Instead of entire network information and model parameters, each sub-GNN only iteratively interacts with its neighbors and computes a highly compressed Feature Vector (FV) representing the current network state, which greatly saves the computing and communication cost. We carried out extensive simulation experiments under multiple real network topologies of different scales. Simulation results show that ScaIR reduces forwarding time by more than 25% and achieves faster convergence. It can better adapt to congested, dynamic or unknown environments. Compared to other methods, it significantly reduces communication cost and computational time, and has better scalability. In addition, by changing the FV length of sub-GNNs, it is verified that GNN does play a key role in ScaIR.</div></div>\",\"PeriodicalId\":50637,\"journal\":{\"name\":\"Computer Networks\",\"volume\":\"257 \",\"pages\":\"Article 110915\"},\"PeriodicalIF\":4.7000,\"publicationDate\":\"2025-02-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Computer Networks\",\"FirstCategoryId\":\"94\",\"ListUrlMain\":\"https://www.sciencedirect.com/science/article/pii/S1389128624007473\",\"RegionNum\":2,\"RegionCategory\":\"计算机科学\",\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"2024/12/2 0:00:00\",\"PubModel\":\"Epub\",\"JCR\":\"Q1\",\"JCRName\":\"COMPUTER SCIENCE, HARDWARE & ARCHITECTURE\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Computer Networks","FirstCategoryId":"94","ListUrlMain":"https://www.sciencedirect.com/science/article/pii/S1389128624007473","RegionNum":2,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"2024/12/2 0:00:00","PubModel":"Epub","JCR":"Q1","JCRName":"COMPUTER SCIENCE, HARDWARE & ARCHITECTURE","Score":null,"Total":0}
引用次数: 0

摘要

传统的路由通常依赖于简单的性能指标,这些指标可以通过决策的数学方法直接推导出来,这通常会导致有限的优化结果。随着未来网络规模的扩大,应用的多样性和业务量的增加,网络环境将变得越来越复杂。相比之下,利用机器学习方法的智能路由(IR)可以对更复杂的性能指标进行建模,使其更适合未来网络的复杂场景。网络复杂性的增加还表明,与收集路由信息和执行决策计算相关的工作负载呈指数级增长。与集中式IR相比,分布式IR (DIR)将计算负载和交互需求分布在多个节点上,从而提供了增强的可伸缩性。然而,DIR根据本地信息做出决策,这限制了全局优化。在本文中,我们提出了一种新的基于分布式图强化学习的可扩展智能路由,称为ScaIR。ScaIR是一种全分布式多智能体路由方法。每个路由器都是一个基于局部图强化学习(RL)的独立代理。利用图神经网络(Graph Neural Networks, GNN)提取全局网络特征作为强化学习的输入,从而增强全局优化能力。特别是这里的GNN也是完全分布的。每台路由器都有一个独立的子gnn,这取决于它与单跳邻居的邻接关系。每个子gnn不需要整个网络的信息和模型参数,只与相邻的子gnn进行迭代交互,并计算一个高度压缩的特征向量(FV)来表示当前网络的状态,大大节省了计算和通信成本。我们在多种不同规模的真实网络拓扑下进行了大量的仿真实验。仿真结果表明,ScaIR算法的转发时间缩短了25%以上,收敛速度更快。它可以更好地适应拥挤、动态或未知的环境。与其他方法相比,显著降低了通信成本和计算时间,具有更好的可扩展性。此外,通过改变子GNN的FV长度,验证了GNN在ScaIR中确实发挥了关键作用。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
ScaIR: Scalable Intelligent Routing based on Distributed Graph Reinforcement Learning
Traditional routing typically relies on simpler performance metrics that can be derived directly through mathematical methods for decision-making, which often results in limited optimization outcomes. As future networks expand, along with the diversity of applications and traffic volume, the network environment grows increasingly complex. In contrast, Intelligent Routing (IR) that leverages machine learning methods can model more complex performance metrics, rendering it better suited to the intricate scenarios of future networks. The increasing complexity of networks also indicates that the workload associated with collecting routing information and executing decision calculations is growing exponentially. Compared to centralized IR, Distributed IR (DIR) distributes the computational load and interaction demands across multiple nodes, thereby offering enhanced scalability. However, DIR makes decisions based on local information, which limits global optimization. In this paper, we propose a novel Scalable Intelligent Routing based on Distributed Graph Reinforcement Learning, called ScaIR. ScaIR is a full y distributed multi-agent routing method. Each router is an independent agent based on local graph Reinforcement Learning (RL). Graph Neural Networks (GNN) are employed to extract global network characteristics which serve as input for RL, thereby enhancing global optimization. Especially, GNN here is also fully distributed. Each router has an independent sub-GNN determined by the adjacency relationships with its one-hop neighbors. Instead of entire network information and model parameters, each sub-GNN only iteratively interacts with its neighbors and computes a highly compressed Feature Vector (FV) representing the current network state, which greatly saves the computing and communication cost. We carried out extensive simulation experiments under multiple real network topologies of different scales. Simulation results show that ScaIR reduces forwarding time by more than 25% and achieves faster convergence. It can better adapt to congested, dynamic or unknown environments. Compared to other methods, it significantly reduces communication cost and computational time, and has better scalability. In addition, by changing the FV length of sub-GNNs, it is verified that GNN does play a key role in ScaIR.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
Computer Networks
Computer Networks 工程技术-电信学
CiteScore
10.80
自引率
3.60%
发文量
434
审稿时长
8.6 months
期刊介绍: Computer Networks is an international, archival journal providing a publication vehicle for complete coverage of all topics of interest to those involved in the computer communications networking area. The audience includes researchers, managers and operators of networks as well as designers and implementors. The Editorial Board will consider any material for publication that is of interest to those groups.
期刊最新文献
Privacy-preserving and secure spectrum sharing for database-driven cognitive radio networks vObliChain: Securing satellite networks with verifiable oblivious search over blockchain databases TraCP: Traffic concentration prior-guided gMLP for APT Detection in extremely imbalanced IIoT traffic Efficient and interpretable IoT botnet detection via feature selection and hyperparameter-optimized XGB SCL-RFM: supervised contrastive learning-based intrusion detection with correlation-driven feature arrangement and regional feature masking
×
引用
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