寻找布尔值网络中的不相交路径

2018 26th Telecommunications Forum (TELFOR) Pub Date : 2018-11-01 DOI:10.1109/TELFOR.2018.8611961

E. Shcherba, G. Litvinov

{"title":"寻找布尔值网络中的不相交路径","authors":"E. Shcherba, G. Litvinov","doi":"10.1109/TELFOR.2018.8611961","DOIUrl":null,"url":null,"abstract":"Algorithms for finding disjoint paths in a network are of great importance for improving reliability of network connections. In this paper, we consider the problem of finding optimal disjoint paths within a specific network model that can be useful for secure routing and quality of service support. We propose an exact algorithm for finding $\\mathbf{k}$ optimal link-disjoint paths in a Boolean-valued network. We also include an example demonstrating the proposed algorithm.","PeriodicalId":229131,"journal":{"name":"2018 26th Telecommunications Forum (TELFOR)","volume":"38 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2018-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"2","resultStr":"{\"title\":\"Finding Disjoint Paths in Boolean-Valued Networks\",\"authors\":\"E. Shcherba, G. Litvinov\",\"doi\":\"10.1109/TELFOR.2018.8611961\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Algorithms for finding disjoint paths in a network are of great importance for improving reliability of network connections. In this paper, we consider the problem of finding optimal disjoint paths within a specific network model that can be useful for secure routing and quality of service support. We propose an exact algorithm for finding $\\\\mathbf{k}$ optimal link-disjoint paths in a Boolean-valued network. We also include an example demonstrating the proposed algorithm.\",\"PeriodicalId\":229131,\"journal\":{\"name\":\"2018 26th Telecommunications Forum (TELFOR)\",\"volume\":\"38 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2018-11-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"2\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2018 26th Telecommunications Forum (TELFOR)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/TELFOR.2018.8611961\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2018 26th Telecommunications Forum (TELFOR)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/TELFOR.2018.8611961","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}

引用次数: 2

摘要

寻找网络中不相交路径的算法对于提高网络连接的可靠性具有重要意义。在本文中，我们考虑在特定网络模型中寻找最优不相交路径的问题，该问题可用于安全路由和服务质量支持。我们提出了一种精确的算法来寻找布尔值网络中$\mathbf{k}$最优的不相交路径。我们还提供了一个示例来演示所提出的算法。

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

查看原文本刊更多论文

Finding Disjoint Paths in Boolean-Valued Networks

Algorithms for finding disjoint paths in a network are of great importance for improving reliability of network connections. In this paper, we consider the problem of finding optimal disjoint paths within a specific network model that can be useful for secure routing and quality of service support. We propose an exact algorithm for finding $\mathbf{k}$ optimal link-disjoint paths in a Boolean-valued network. We also include an example demonstrating the proposed algorithm.

求助全文

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

来源期刊

2018 26th Telecommunications Forum (TELFOR)

自引率

0.00%

发文量