一种基于切割的终端对可靠性方法

Yu G. Chen, M. Yuang
{"title":"一种基于切割的终端对可靠性方法","authors":"Yu G. Chen, M. Yuang","doi":"10.1109/GLOCOM.1995.502546","DOIUrl":null,"url":null,"abstract":"Terminal-pair reliability determines the probabilistic reliability between two nodes of a network, given the failure probabilities of all links. The problem has been successfully solved by the path-based partition method, network reduction technique, and the combination of the two. The path-based partition algorithm, however, requires repeated execution of a path-search procedure in an attempt to locally minimize the total number of subproblems generated. We propose a cut-based partition algorithm based on the minimum cut separating the source from the remaining network nodes. This cut-based algorithm makes no attempt to locally minimize the number of subproblems. Instead, the algorithm leads to a great reduction of the computation time for the partitioning of each subproblem. Experimental results show the superiority of the cut-based algorithm over the path-based algorithm especially for complex networks. By further employing the network reduction technique, our cut-based partition algorithm outperforms the path-based partition algorithm for all benchmarks and random sparse or dense networks. Based on the cut-based partition algorithm, we further present an incremental method of computing the terminal-pair reliability for hierarchical networks. The incremental method results in minimal recomputation of the reliability should the network configuration change.","PeriodicalId":152724,"journal":{"name":"Proceedings of GLOBECOM '95","volume":"29 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1995-11-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"55","resultStr":"{\"title\":\"A cut-based method for terminal-pair reliability\",\"authors\":\"Yu G. Chen, M. Yuang\",\"doi\":\"10.1109/GLOCOM.1995.502546\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Terminal-pair reliability determines the probabilistic reliability between two nodes of a network, given the failure probabilities of all links. The problem has been successfully solved by the path-based partition method, network reduction technique, and the combination of the two. The path-based partition algorithm, however, requires repeated execution of a path-search procedure in an attempt to locally minimize the total number of subproblems generated. We propose a cut-based partition algorithm based on the minimum cut separating the source from the remaining network nodes. This cut-based algorithm makes no attempt to locally minimize the number of subproblems. Instead, the algorithm leads to a great reduction of the computation time for the partitioning of each subproblem. Experimental results show the superiority of the cut-based algorithm over the path-based algorithm especially for complex networks. By further employing the network reduction technique, our cut-based partition algorithm outperforms the path-based partition algorithm for all benchmarks and random sparse or dense networks. Based on the cut-based partition algorithm, we further present an incremental method of computing the terminal-pair reliability for hierarchical networks. The incremental method results in minimal recomputation of the reliability should the network configuration change.\",\"PeriodicalId\":152724,\"journal\":{\"name\":\"Proceedings of GLOBECOM '95\",\"volume\":\"29 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"1995-11-14\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"55\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Proceedings of GLOBECOM '95\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/GLOCOM.1995.502546\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Proceedings of GLOBECOM '95","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/GLOCOM.1995.502546","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 55

摘要

终端对可靠性决定了在给定所有链路故障概率的情况下,网络中两个节点之间的概率可靠性。通过基于路径的划分方法、网络约简技术以及两者的结合,成功地解决了这一问题。然而,基于路径的分区算法需要重复执行路径搜索过程,以尝试在局部最小化生成的子问题的总数。我们提出了一种基于最小分割的分割算法,该算法将源节点与剩余网络节点分开。这种基于切割的算法不试图局部最小化子问题的数量。相反,该算法大大减少了每个子问题划分的计算时间。实验结果表明,在复杂网络中,基于切口的算法优于基于路径的算法。通过进一步采用网络约简技术,我们的基于切的分区算法在所有基准测试和随机稀疏或密集网络中都优于基于路径的分区算法。在基于分割算法的基础上,进一步提出了一种计算分层网络终端对可靠性的增量方法。当网络配置发生变化时,增量方法可以使可靠性的重新计算最小化。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
A cut-based method for terminal-pair reliability
Terminal-pair reliability determines the probabilistic reliability between two nodes of a network, given the failure probabilities of all links. The problem has been successfully solved by the path-based partition method, network reduction technique, and the combination of the two. The path-based partition algorithm, however, requires repeated execution of a path-search procedure in an attempt to locally minimize the total number of subproblems generated. We propose a cut-based partition algorithm based on the minimum cut separating the source from the remaining network nodes. This cut-based algorithm makes no attempt to locally minimize the number of subproblems. Instead, the algorithm leads to a great reduction of the computation time for the partitioning of each subproblem. Experimental results show the superiority of the cut-based algorithm over the path-based algorithm especially for complex networks. By further employing the network reduction technique, our cut-based partition algorithm outperforms the path-based partition algorithm for all benchmarks and random sparse or dense networks. Based on the cut-based partition algorithm, we further present an incremental method of computing the terminal-pair reliability for hierarchical networks. The incremental method results in minimal recomputation of the reliability should the network configuration change.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:604180095
Book学术官方微信