{"title":"Series-parallel transformation for diameter constrained network reliability computation","authors":"Sergei N. Nesterov, D. Migov","doi":"10.1109/SIBIRCON.2017.8109852","DOIUrl":null,"url":null,"abstract":"The reliability of a network with a diameter constraint is defined as the probabilistic connectivity of each pair of nodes by paths that travel through a limited number of communication channels. The task of diameter constraint network reliability calculation is NP-hard, so it is relevant to use various reduction and decomposition methods. We propose to use a serial-parallel network transformation in the preliminary step before factoring. Further, we develop this approach in order to perform the serial-parallel transformation on each recursive call of the factoring procedure by H. Cancela and L. Petingi. Such reduction allows to greatly reduce network reliability computational time.","PeriodicalId":135870,"journal":{"name":"2017 International Multi-Conference on Engineering, Computer and Information Sciences (SIBIRCON)","volume":null,"pages":null},"PeriodicalIF":0.0000,"publicationDate":"2017-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2017 International Multi-Conference on Engineering, Computer and Information Sciences (SIBIRCON)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/SIBIRCON.2017.8109852","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0
Abstract
The reliability of a network with a diameter constraint is defined as the probabilistic connectivity of each pair of nodes by paths that travel through a limited number of communication channels. The task of diameter constraint network reliability calculation is NP-hard, so it is relevant to use various reduction and decomposition methods. We propose to use a serial-parallel network transformation in the preliminary step before factoring. Further, we develop this approach in order to perform the serial-parallel transformation on each recursive call of the factoring procedure by H. Cancela and L. Petingi. Such reduction allows to greatly reduce network reliability computational time.
京公网安备 11010802042870号
京ICP备2023020795号-1
分享
求助内容：
应助结果提醒方式：
扫码关注我们
