最宽边不相交路径对字典优化的启发式算法

2014 6th International Workshop on Reliable Networks Design and Modeling (RNDM) Pub Date : 2014-11-01 DOI:10.1109/RNDM.2014.7014925

P. Cruz, Teresa Gomes, D. Medhi

{"title":"最宽边不相交路径对字典优化的启发式算法","authors":"P. Cruz, Teresa Gomes, D. Medhi","doi":"10.1109/RNDM.2014.7014925","DOIUrl":null,"url":null,"abstract":"Telecommunication services are pervasive in today's human activity and are required to offer reliable and quality-of-service(QoS)-aware guaranteed services. In global path protection, the working path between a source and a destination can be protected by a backup path, which ensures data transfer in the event of a failure that makes the working path to be unavailable. Multipath and disjoint routing may require the calculation of disjoint paths maximizing the total bandwidth of the path pair (or set of paths) or the calculation of maximum-bandwidth disjoint paths. In this paper, a lexicographic optimization problem for obtaining maximum-bandwidth disjoint paths, and then maximizing the bandwidth of the widest path in the pair, is formalized. An effective heuristic for addressing this problem is presented.","PeriodicalId":299072,"journal":{"name":"2014 6th International Workshop on Reliable Networks Design and Modeling (RNDM)","volume":"32 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2014-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"11","resultStr":"{\"title\":\"A heuristic for widest edge-disjoint path pair lexicographic optimization\",\"authors\":\"P. Cruz, Teresa Gomes, D. Medhi\",\"doi\":\"10.1109/RNDM.2014.7014925\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Telecommunication services are pervasive in today's human activity and are required to offer reliable and quality-of-service(QoS)-aware guaranteed services. In global path protection, the working path between a source and a destination can be protected by a backup path, which ensures data transfer in the event of a failure that makes the working path to be unavailable. Multipath and disjoint routing may require the calculation of disjoint paths maximizing the total bandwidth of the path pair (or set of paths) or the calculation of maximum-bandwidth disjoint paths. In this paper, a lexicographic optimization problem for obtaining maximum-bandwidth disjoint paths, and then maximizing the bandwidth of the widest path in the pair, is formalized. An effective heuristic for addressing this problem is presented.\",\"PeriodicalId\":299072,\"journal\":{\"name\":\"2014 6th International Workshop on Reliable Networks Design and Modeling (RNDM)\",\"volume\":\"32 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2014-11-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"11\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2014 6th International Workshop on Reliable Networks Design and Modeling (RNDM)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/RNDM.2014.7014925\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2014 6th International Workshop on Reliable Networks Design and Modeling (RNDM)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/RNDM.2014.7014925","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}

引用次数: 11

摘要

电信服务在当今人类活动中无处不在，需要提供可靠和服务质量(QoS)感知的保证服务。在全局路径保护中，源和目的之间的工作路径可以通过备份路径进行保护，当工作路径发生故障导致不可用时，可以保证数据的传输。多路径和不相交路由可能需要计算使路径对(或路径集)总带宽最大化的不相交路径，或者计算最大带宽不相交路径。本文形式化了一个获取最大带宽不相交路径并使最宽路径的带宽最大化的字典排序优化问题。提出了一种有效的启发式方法来解决这个问题。

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

查看原文本刊更多论文

A heuristic for widest edge-disjoint path pair lexicographic optimization

Telecommunication services are pervasive in today's human activity and are required to offer reliable and quality-of-service(QoS)-aware guaranteed services. In global path protection, the working path between a source and a destination can be protected by a backup path, which ensures data transfer in the event of a failure that makes the working path to be unavailable. Multipath and disjoint routing may require the calculation of disjoint paths maximizing the total bandwidth of the path pair (or set of paths) or the calculation of maximum-bandwidth disjoint paths. In this paper, a lexicographic optimization problem for obtaining maximum-bandwidth disjoint paths, and then maximizing the bandwidth of the widest path in the pair, is formalized. An effective heuristic for addressing this problem is presented.

求助全文

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

来源期刊

2014 6th International Workshop on Reliable Networks Design and Modeling (RNDM)

自引率

0.00%

发文量