Yingya Guo, Zebo Huang, Mingjie Ding, Bin Lin, Huan Luo
{"title":"基于监督学习的持久路由优化方法","authors":"Yingya Guo, Zebo Huang, Mingjie Ding, Bin Lin, Huan Luo","doi":"10.1016/j.jnca.2025.104223","DOIUrl":null,"url":null,"abstract":"<div><div>Traditional Traffic Engineering (TE) typically improves network performance by formulating and solving routing optimization problems based on measured or predicted Traffic Matrices (TMs). However, since network traffic is dynamic, routing strategies optimized for the current measured TMs may not be suitable for future traffic patterns. To adapt to dynamic traffic, one possible solution is to perform more frequent routing updates, but this may lead to service disruptions. Another approach is the two-step method of prediction followed by optimization, which could lead to degraded performance of routing strategies due to inaccuracies in traffic prediction. Additionally, existing approaches focus solely on either distributed or centralized networks, lacking flexibility to adapt to different network architectures. To address these challenges, we propose PROM, a Machine Learning (ML)-based routing optimization model that directly predicts an effective routing strategy in an end-to-end manner based on historical traffic. This routing strategy is applicable across multiple future TMs, thereby reducing the need for frequent routing updates. Furthermore, PROM can be easily extended from a centralized implementation to a distributed one, adapting to different network architectures. To enhance model performance, we have also designed a custom loss function for routing optimization scenarios to avoid overfitting. Extensive simulation results demonstrate that PROM can predict high-quality routing strategies in future unknown traffic scenarios and is adaptable to both centralized and distributed network architectures.</div></div>","PeriodicalId":54784,"journal":{"name":"Journal of Network and Computer Applications","volume":"242 ","pages":"Article 104223"},"PeriodicalIF":7.7000,"publicationDate":"2025-06-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"PROM: A persistent routing optimization method based on supervised learning\",\"authors\":\"Yingya Guo, Zebo Huang, Mingjie Ding, Bin Lin, Huan Luo\",\"doi\":\"10.1016/j.jnca.2025.104223\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"<div><div>Traditional Traffic Engineering (TE) typically improves network performance by formulating and solving routing optimization problems based on measured or predicted Traffic Matrices (TMs). However, since network traffic is dynamic, routing strategies optimized for the current measured TMs may not be suitable for future traffic patterns. To adapt to dynamic traffic, one possible solution is to perform more frequent routing updates, but this may lead to service disruptions. Another approach is the two-step method of prediction followed by optimization, which could lead to degraded performance of routing strategies due to inaccuracies in traffic prediction. Additionally, existing approaches focus solely on either distributed or centralized networks, lacking flexibility to adapt to different network architectures. To address these challenges, we propose PROM, a Machine Learning (ML)-based routing optimization model that directly predicts an effective routing strategy in an end-to-end manner based on historical traffic. This routing strategy is applicable across multiple future TMs, thereby reducing the need for frequent routing updates. Furthermore, PROM can be easily extended from a centralized implementation to a distributed one, adapting to different network architectures. To enhance model performance, we have also designed a custom loss function for routing optimization scenarios to avoid overfitting. Extensive simulation results demonstrate that PROM can predict high-quality routing strategies in future unknown traffic scenarios and is adaptable to both centralized and distributed network architectures.</div></div>\",\"PeriodicalId\":54784,\"journal\":{\"name\":\"Journal of Network and Computer Applications\",\"volume\":\"242 \",\"pages\":\"Article 104223\"},\"PeriodicalIF\":7.7000,\"publicationDate\":\"2025-06-08\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Journal of Network and Computer Applications\",\"FirstCategoryId\":\"94\",\"ListUrlMain\":\"https://www.sciencedirect.com/science/article/pii/S1084804525001201\",\"RegionNum\":2,\"RegionCategory\":\"计算机科学\",\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q1\",\"JCRName\":\"COMPUTER SCIENCE, HARDWARE & ARCHITECTURE\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Journal of Network and Computer Applications","FirstCategoryId":"94","ListUrlMain":"https://www.sciencedirect.com/science/article/pii/S1084804525001201","RegionNum":2,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q1","JCRName":"COMPUTER SCIENCE, HARDWARE & ARCHITECTURE","Score":null,"Total":0}
PROM: A persistent routing optimization method based on supervised learning
Traditional Traffic Engineering (TE) typically improves network performance by formulating and solving routing optimization problems based on measured or predicted Traffic Matrices (TMs). However, since network traffic is dynamic, routing strategies optimized for the current measured TMs may not be suitable for future traffic patterns. To adapt to dynamic traffic, one possible solution is to perform more frequent routing updates, but this may lead to service disruptions. Another approach is the two-step method of prediction followed by optimization, which could lead to degraded performance of routing strategies due to inaccuracies in traffic prediction. Additionally, existing approaches focus solely on either distributed or centralized networks, lacking flexibility to adapt to different network architectures. To address these challenges, we propose PROM, a Machine Learning (ML)-based routing optimization model that directly predicts an effective routing strategy in an end-to-end manner based on historical traffic. This routing strategy is applicable across multiple future TMs, thereby reducing the need for frequent routing updates. Furthermore, PROM can be easily extended from a centralized implementation to a distributed one, adapting to different network architectures. To enhance model performance, we have also designed a custom loss function for routing optimization scenarios to avoid overfitting. Extensive simulation results demonstrate that PROM can predict high-quality routing strategies in future unknown traffic scenarios and is adaptable to both centralized and distributed network architectures.
期刊介绍:
The Journal of Network and Computer Applications welcomes research contributions, surveys, and notes in all areas relating to computer networks and applications thereof. Sample topics include new design techniques, interesting or novel applications, components or standards; computer networks with tools such as WWW; emerging standards for internet protocols; Wireless networks; Mobile Computing; emerging computing models such as cloud computing, grid computing; applications of networked systems for remote collaboration and telemedicine, etc. The journal is abstracted and indexed in Scopus, Engineering Index, Web of Science, Science Citation Index Expanded and INSPEC.