{"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}
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.