{"title":"Reliability maximization in stochastic binary systems","authors":"H. Cancela, G. Guerberoff, F. Robledo, P. Romero","doi":"10.1109/ICIN.2018.8401638","DOIUrl":null,"url":null,"abstract":"A Stochastic Binary System (SBS) is a mathematical model of multi-component on-off systems subject to random failures. This model is an extension of network reliability models (where the components are either nodes or links). The reliability maximization is a major network design problem, where the goal is to find the network that maximizes the reliability subject to budget constraints. Even though the problem is computationally hard, the scientific literature offers uniformly most-reliable graphs for specific cases, and necessary criteria for optimality. The concept of uniformly most-reliable stochastic binary system is here introduced. We discuss some basic aspects which must be taken into account to develop a theory of reliability maximization in this setting: computational complexity, necessary conditions for reliability maximization and shared results with the classical theory for network design.","PeriodicalId":103076,"journal":{"name":"2018 21st Conference on Innovation in Clouds, Internet and Networks and Workshops (ICIN)","volume":"06 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2018-02-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"3","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2018 21st Conference on Innovation in Clouds, Internet and Networks and Workshops (ICIN)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICIN.2018.8401638","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 3
Abstract
A Stochastic Binary System (SBS) is a mathematical model of multi-component on-off systems subject to random failures. This model is an extension of network reliability models (where the components are either nodes or links). The reliability maximization is a major network design problem, where the goal is to find the network that maximizes the reliability subject to budget constraints. Even though the problem is computationally hard, the scientific literature offers uniformly most-reliable graphs for specific cases, and necessary criteria for optimality. The concept of uniformly most-reliable stochastic binary system is here introduced. We discuss some basic aspects which must be taken into account to develop a theory of reliability maximization in this setting: computational complexity, necessary conditions for reliability maximization and shared results with the classical theory for network design.