电信网络中寻找最大srlg -不相交/最短路径对双准则的精确方法

IF 1.1 4区计算机科学 Q4 COMPUTER SCIENCE, INFORMATION SYSTEMS

Infor Pub Date : 2023-07-11 DOI:10.1080/03155986.2023.2228021

J. Craveirinha, M. Pascoal, J. Clímaco

{"title":"电信网络中寻找最大srlg -不相交/最短路径对双准则的精确方法","authors":"J. Craveirinha, M. Pascoal, J. Clímaco","doi":"10.1080/03155986.2023.2228021","DOIUrl":null,"url":null,"abstract":"Abstract The paper addresses a bicriteria optimisation problem in telecommunication networks that aims at finding Pareto efficient pairs of paths between two given nodes, seeking to minimise the number of SRLGs (Shared Risk Link Groups) common to both paths and the path pair cost. This problem is of particular importance in telecommunication routing design, namely concerning resilient routing models where both a primary and a backup paths have to be calculated to minimise the risk of failure of a connection between origin and terminal nodes, in case of failure in the primary path. An exact resolution method is applied for solving this problem, enabling the calculation of the whole set of Pareto optimal solutions, which combines a transformation of the network representation with a path ranking algorithm. A comprehensive experimental study on the application of this approach, using reference network topologies, considering random SRLG assignments to the links and random link bandwidth occupations, together with the discussion on typical examples of solution selection and potential advantages of the method, are presented.","PeriodicalId":13645,"journal":{"name":"Infor","volume":"6 3 1","pages":"399 - 418"},"PeriodicalIF":1.1000,"publicationDate":"2023-07-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"An exact approach for finding bicriteria maximally SRLG-disjoint/shortest path pairs in telecommunication networks\",\"authors\":\"J. Craveirinha, M. Pascoal, J. Clímaco\",\"doi\":\"10.1080/03155986.2023.2228021\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Abstract The paper addresses a bicriteria optimisation problem in telecommunication networks that aims at finding Pareto efficient pairs of paths between two given nodes, seeking to minimise the number of SRLGs (Shared Risk Link Groups) common to both paths and the path pair cost. This problem is of particular importance in telecommunication routing design, namely concerning resilient routing models where both a primary and a backup paths have to be calculated to minimise the risk of failure of a connection between origin and terminal nodes, in case of failure in the primary path. An exact resolution method is applied for solving this problem, enabling the calculation of the whole set of Pareto optimal solutions, which combines a transformation of the network representation with a path ranking algorithm. A comprehensive experimental study on the application of this approach, using reference network topologies, considering random SRLG assignments to the links and random link bandwidth occupations, together with the discussion on typical examples of solution selection and potential advantages of the method, are presented.\",\"PeriodicalId\":13645,\"journal\":{\"name\":\"Infor\",\"volume\":\"6 3 1\",\"pages\":\"399 - 418\"},\"PeriodicalIF\":1.1000,\"publicationDate\":\"2023-07-11\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Infor\",\"FirstCategoryId\":\"94\",\"ListUrlMain\":\"https://doi.org/10.1080/03155986.2023.2228021\",\"RegionNum\":4,\"RegionCategory\":\"计算机科学\",\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q4\",\"JCRName\":\"COMPUTER SCIENCE, INFORMATION SYSTEMS\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Infor","FirstCategoryId":"94","ListUrlMain":"https://doi.org/10.1080/03155986.2023.2228021","RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q4","JCRName":"COMPUTER SCIENCE, INFORMATION SYSTEMS","Score":null,"Total":0}

引用次数: 0

摘要

摘要:本文解决了电信网络中的双标准优化问题，该问题旨在找到两个给定节点之间的帕累托有效路径对，寻求最小化两条路径共有的SRLGs(共享风险链路组)的数量和路径对成本。这个问题在电信路由设计中特别重要，即涉及弹性路由模型，其中必须计算主路径和备份路径，以便在主路径发生故障的情况下，将起源节点和终端节点之间连接失败的风险降至最低。该方法将网络表示的变换与路径排序算法相结合，实现了整个Pareto最优解集的计算。利用参考网络拓扑，考虑随机SRLG分配到链路和随机链路带宽占用，对该方法的应用进行了全面的实验研究，并讨论了解决方案选择的典型示例和该方法的潜在优势。

本文章由计算机程序翻译，如有差异，请以英文原文为准。

查看原文本刊更多论文

An exact approach for finding bicriteria maximally SRLG-disjoint/shortest path pairs in telecommunication networks

Abstract The paper addresses a bicriteria optimisation problem in telecommunication networks that aims at finding Pareto efficient pairs of paths between two given nodes, seeking to minimise the number of SRLGs (Shared Risk Link Groups) common to both paths and the path pair cost. This problem is of particular importance in telecommunication routing design, namely concerning resilient routing models where both a primary and a backup paths have to be calculated to minimise the risk of failure of a connection between origin and terminal nodes, in case of failure in the primary path. An exact resolution method is applied for solving this problem, enabling the calculation of the whole set of Pareto optimal solutions, which combines a transformation of the network representation with a path ranking algorithm. A comprehensive experimental study on the application of this approach, using reference network topologies, considering random SRLG assignments to the links and random link bandwidth occupations, together with the discussion on typical examples of solution selection and potential advantages of the method, are presented.

求助全文

通过发布文献求助，成功后即可免费获取论文全文。去求助

来源期刊

Infor 管理科学-计算机：信息系统

CiteScore

2.60

自引率

7.70%

发文量

审稿时长

>12 weeks

期刊介绍： INFOR: Information Systems and Operational Research is published and sponsored by the Canadian Operational Research Society. It provides its readers with papers on a powerful combination of subjects: Information Systems and Operational Research. The importance of combining IS and OR in one journal is that both aim to expand quantitative scientific approaches to management. With this integration, the theory, methodology, and practice of OR and IS are thoroughly examined. INFOR is available in print and online.