{"title":"基于元学习算法选择的通信网络流量恢复——以ip -光SDN网络为例","authors":"R. Reyes, T. Bauschert","doi":"10.1109/LATINCOM56090.2022.10000493","DOIUrl":null,"url":null,"abstract":"The performance of optimization algorithms for traffic restoration in communication networks is dependent on the characteristics of the problem instance. There is no known best algorithm that performs well for all instance realizations of any given traffic restoration problem. In this paper we argue that for a given problem instance, optimum or near-optimum performance can be attained through algorithm selection (AS). The objective is to select from a set of candidate algorithms, the one that performs best for the problem instance. For that, AS is formulated as a learning problem where a Machine-learning algorithm learns the relation between the instance properties and the performance of the candidate algorithms. As case study, the approach is applied for traffic restoration in IP-Optical networks. In these networks, optical failures may affect multiple IP links simultaneously. As a result, the IP layer has to perform traffic restoration by rerouting the affected IP flows. This can be carried out by a hyperheuristic method that performs traffic engineering to minimize the spare capacity utilized for traffic protection. The approach applies AS to choose the best algorithm from a set of heuristics for IP traffic rerouting. Results on selected scenarios show that AS predicts with high precision the heuristic that requires minimum spare capacity.","PeriodicalId":221354,"journal":{"name":"2022 IEEE Latin-American Conference on Communications (LATINCOM)","volume":"247 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2022-11-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Traffic Restoration in Communication Networks by Meta-Learning Inspired Algorithm Selection: A Case Study for IP-Optical SDN Networks\",\"authors\":\"R. Reyes, T. Bauschert\",\"doi\":\"10.1109/LATINCOM56090.2022.10000493\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"The performance of optimization algorithms for traffic restoration in communication networks is dependent on the characteristics of the problem instance. There is no known best algorithm that performs well for all instance realizations of any given traffic restoration problem. In this paper we argue that for a given problem instance, optimum or near-optimum performance can be attained through algorithm selection (AS). The objective is to select from a set of candidate algorithms, the one that performs best for the problem instance. For that, AS is formulated as a learning problem where a Machine-learning algorithm learns the relation between the instance properties and the performance of the candidate algorithms. As case study, the approach is applied for traffic restoration in IP-Optical networks. In these networks, optical failures may affect multiple IP links simultaneously. As a result, the IP layer has to perform traffic restoration by rerouting the affected IP flows. This can be carried out by a hyperheuristic method that performs traffic engineering to minimize the spare capacity utilized for traffic protection. The approach applies AS to choose the best algorithm from a set of heuristics for IP traffic rerouting. Results on selected scenarios show that AS predicts with high precision the heuristic that requires minimum spare capacity.\",\"PeriodicalId\":221354,\"journal\":{\"name\":\"2022 IEEE Latin-American Conference on Communications (LATINCOM)\",\"volume\":\"247 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2022-11-30\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2022 IEEE Latin-American Conference on Communications (LATINCOM)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/LATINCOM56090.2022.10000493\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2022 IEEE Latin-American Conference on Communications (LATINCOM)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/LATINCOM56090.2022.10000493","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Traffic Restoration in Communication Networks by Meta-Learning Inspired Algorithm Selection: A Case Study for IP-Optical SDN Networks
The performance of optimization algorithms for traffic restoration in communication networks is dependent on the characteristics of the problem instance. There is no known best algorithm that performs well for all instance realizations of any given traffic restoration problem. In this paper we argue that for a given problem instance, optimum or near-optimum performance can be attained through algorithm selection (AS). The objective is to select from a set of candidate algorithms, the one that performs best for the problem instance. For that, AS is formulated as a learning problem where a Machine-learning algorithm learns the relation between the instance properties and the performance of the candidate algorithms. As case study, the approach is applied for traffic restoration in IP-Optical networks. In these networks, optical failures may affect multiple IP links simultaneously. As a result, the IP layer has to perform traffic restoration by rerouting the affected IP flows. This can be carried out by a hyperheuristic method that performs traffic engineering to minimize the spare capacity utilized for traffic protection. The approach applies AS to choose the best algorithm from a set of heuristics for IP traffic rerouting. Results on selected scenarios show that AS predicts with high precision the heuristic that requires minimum spare capacity.