{"title":"Two Approximate Approaches for Reliability Evaluation in Large Networks. Comparative Study","authors":"P. Cașcaval, S. Floria","doi":"10.1109/ICSTCC.2018.8540730","DOIUrl":null,"url":null,"abstract":"This paper deals with the complex problem of reliability evaluation of stochastic networks in which both links and nodes failures are considered, and compares two approximate approaches able to reduce the computation time: a sum of disjoint products (SDP) approach and another based on Monte Carlo simulation. In case of the SDP approach, the reliability is computed based on the minimal paths. In a first stage, only the links of the network are considered, and a ‘multiple variables inversion’ technique for developing the set of minimal paths into a sum of disjoint products is applied. Then, in a second stage, each term of the set of disjoint Iink- products is processed separately taking into consideration the reliability values for both links and adjacent nodes. In case of Monte Carlo simulation, for speeding up the method and reducing the computation time, both minimal paths and cuts are considered. Also, other acceleration techniques are applied.","PeriodicalId":308427,"journal":{"name":"2018 22nd International Conference on System Theory, Control and Computing (ICSTCC)","volume":"25 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2018-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2018 22nd International Conference on System Theory, Control and Computing (ICSTCC)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICSTCC.2018.8540730","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 1
Abstract
This paper deals with the complex problem of reliability evaluation of stochastic networks in which both links and nodes failures are considered, and compares two approximate approaches able to reduce the computation time: a sum of disjoint products (SDP) approach and another based on Monte Carlo simulation. In case of the SDP approach, the reliability is computed based on the minimal paths. In a first stage, only the links of the network are considered, and a ‘multiple variables inversion’ technique for developing the set of minimal paths into a sum of disjoint products is applied. Then, in a second stage, each term of the set of disjoint Iink- products is processed separately taking into consideration the reliability values for both links and adjacent nodes. In case of Monte Carlo simulation, for speeding up the method and reducing the computation time, both minimal paths and cuts are considered. Also, other acceleration techniques are applied.