Leveraging Graph Attention Network for SDN Routing Performance Prediction

Yonghua Huo, Y. Liu, Shilong Zhao, Peng Yu
{"title":"Leveraging Graph Attention Network for SDN Routing Performance Prediction","authors":"Yonghua Huo, Y. Liu, Shilong Zhao, Peng Yu","doi":"10.1109/ICIPNP57450.2022.00010","DOIUrl":null,"url":null,"abstract":"With the continuous expansion of the network scale, the network topology is becoming increasingly complex, and the link status between network devices will also change dynamically according to real-time load, link quality and other factors, increasing the difficulty of solving network optimization problems. Therefore, an efficient and fine-grained network model is essential to achieve the goal of efficient and autonomous network optimization. As the development direction of future network architecture, Software Defined Networking (SDN) technology can effectively set up routing schemes and flexibly control network traffic by separating data plane and control plane. In the process of routing scheme optimization, the key is to accurately estimate the network performance under a given routing scheme. In this paper, we propose a SDN routing performance prediction model based on graph attention network. Based on graph attention network, this model models the relationship between physical links and routing scheme paths in the network. Under the given routing scheme and network traffic, it accurately estimates each end-to-end performance index in the network to assist in optimizing the routing scheme.","PeriodicalId":231493,"journal":{"name":"2022 International Conference on Information Processing and Network Provisioning (ICIPNP)","volume":"22 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2022-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2022 International Conference on Information Processing and Network Provisioning (ICIPNP)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICIPNP57450.2022.00010","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

Abstract

With the continuous expansion of the network scale, the network topology is becoming increasingly complex, and the link status between network devices will also change dynamically according to real-time load, link quality and other factors, increasing the difficulty of solving network optimization problems. Therefore, an efficient and fine-grained network model is essential to achieve the goal of efficient and autonomous network optimization. As the development direction of future network architecture, Software Defined Networking (SDN) technology can effectively set up routing schemes and flexibly control network traffic by separating data plane and control plane. In the process of routing scheme optimization, the key is to accurately estimate the network performance under a given routing scheme. In this paper, we propose a SDN routing performance prediction model based on graph attention network. Based on graph attention network, this model models the relationship between physical links and routing scheme paths in the network. Under the given routing scheme and network traffic, it accurately estimates each end-to-end performance index in the network to assist in optimizing the routing scheme.
利用图关注网络进行SDN路由性能预测
随着网络规模的不断扩大,网络拓扑结构日益复杂,网络设备之间的链路状态也会根据实时负载、链路质量等因素动态变化,增加了解决网络优化问题的难度。因此,要实现高效、自主的网络优化目标,一个高效、细粒度的网络模型至关重要。软件定义网络(SDN)技术通过分离数据平面和控制平面,可以有效地建立路由方案,灵活地控制网络流量,是未来网络架构的发展方向。在路由方案优化过程中,关键是准确估计给定路由方案下的网络性能。本文提出了一种基于图关注网络的SDN路由性能预测模型。该模型基于图关注网络,对网络中物理链路与路由方案路径之间的关系进行建模。在给定的路由方案和网络流量下,准确估计网络中端到端各性能指标,帮助优化路由方案。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
自引率
0.00%
发文量
0
×
引用
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学术官方微信