{"title":"分布式系统可靠性评估算法","authors":"Anup Kumar, S. Rai, D. Agrawal","doi":"10.1109/INFCOM.1988.13000","DOIUrl":null,"url":null,"abstract":"The authors introduce two techniques for computing the reliability of a distributed computing system (DCS). The first scheme uses two steps and requires enumeration of multiterminal connections which, in turn, leads to the reliability expression. The second technique, called FARE (Fast Algorithm for Reliability Evaluation), does not require an a priori knowledge of multiterminal connections for computing the reliability expression. A performance parameter called the communication cost index (CCI) is defined. The authors compare algorithms with an existing method in terms of computer time and memory requirement. The results show that FARE outperforms two-step methods.<<ETX>>","PeriodicalId":436217,"journal":{"name":"IEEE INFOCOM '88,Seventh Annual Joint Conference of the IEEE Computer and Communcations Societies. Networks: Evolution or Revolution?","volume":"75 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1988-03-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"14","resultStr":"{\"title\":\"Reliability evaluation algorithms for distributed systems\",\"authors\":\"Anup Kumar, S. Rai, D. Agrawal\",\"doi\":\"10.1109/INFCOM.1988.13000\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"The authors introduce two techniques for computing the reliability of a distributed computing system (DCS). The first scheme uses two steps and requires enumeration of multiterminal connections which, in turn, leads to the reliability expression. The second technique, called FARE (Fast Algorithm for Reliability Evaluation), does not require an a priori knowledge of multiterminal connections for computing the reliability expression. A performance parameter called the communication cost index (CCI) is defined. The authors compare algorithms with an existing method in terms of computer time and memory requirement. The results show that FARE outperforms two-step methods.<<ETX>>\",\"PeriodicalId\":436217,\"journal\":{\"name\":\"IEEE INFOCOM '88,Seventh Annual Joint Conference of the IEEE Computer and Communcations Societies. Networks: Evolution or Revolution?\",\"volume\":\"75 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"1988-03-27\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"14\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"IEEE INFOCOM '88,Seventh Annual Joint Conference of the IEEE Computer and Communcations Societies. Networks: Evolution or Revolution?\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/INFCOM.1988.13000\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"IEEE INFOCOM '88,Seventh Annual Joint Conference of the IEEE Computer and Communcations Societies. Networks: Evolution or Revolution?","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/INFCOM.1988.13000","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Reliability evaluation algorithms for distributed systems
The authors introduce two techniques for computing the reliability of a distributed computing system (DCS). The first scheme uses two steps and requires enumeration of multiterminal connections which, in turn, leads to the reliability expression. The second technique, called FARE (Fast Algorithm for Reliability Evaluation), does not require an a priori knowledge of multiterminal connections for computing the reliability expression. A performance parameter called the communication cost index (CCI) is defined. The authors compare algorithms with an existing method in terms of computer time and memory requirement. The results show that FARE outperforms two-step methods.<>