{"title":"关于超立方体可靠性","authors":"S. Rai","doi":"10.1109/SSST.1990.138163","DOIUrl":null,"url":null,"abstract":"Techniques for generating approximate measures for terminal and network reliability in a hypercube architecture are described. First, the author considers the total number of s-t paths of cardinability H(s,t) and H(s,t)+2, where H(s,t) represents the Hamming distance between source s and terminal t, and generates a bound on terminal reliability. Various theorems which help arrive at the solution are stated and proved. Second, utilizing the concept of degree matrix (for B/sub n/), the author presents a method to obtain the total number of spanning trees in B/sub n/ and hence an approximate measure for network reliability.<<ETX>>","PeriodicalId":201543,"journal":{"name":"[1990] Proceedings. The Twenty-Second Southeastern Symposium on System Theory","volume":"670 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1990-03-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"2","resultStr":"{\"title\":\"On hypercube reliability\",\"authors\":\"S. Rai\",\"doi\":\"10.1109/SSST.1990.138163\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Techniques for generating approximate measures for terminal and network reliability in a hypercube architecture are described. First, the author considers the total number of s-t paths of cardinability H(s,t) and H(s,t)+2, where H(s,t) represents the Hamming distance between source s and terminal t, and generates a bound on terminal reliability. Various theorems which help arrive at the solution are stated and proved. Second, utilizing the concept of degree matrix (for B/sub n/), the author presents a method to obtain the total number of spanning trees in B/sub n/ and hence an approximate measure for network reliability.<<ETX>>\",\"PeriodicalId\":201543,\"journal\":{\"name\":\"[1990] Proceedings. The Twenty-Second Southeastern Symposium on System Theory\",\"volume\":\"670 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"1990-03-11\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"2\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"[1990] Proceedings. The Twenty-Second Southeastern Symposium on System Theory\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/SSST.1990.138163\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"[1990] Proceedings. The Twenty-Second Southeastern Symposium on System Theory","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/SSST.1990.138163","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Techniques for generating approximate measures for terminal and network reliability in a hypercube architecture are described. First, the author considers the total number of s-t paths of cardinability H(s,t) and H(s,t)+2, where H(s,t) represents the Hamming distance between source s and terminal t, and generates a bound on terminal reliability. Various theorems which help arrive at the solution are stated and proved. Second, utilizing the concept of degree matrix (for B/sub n/), the author presents a method to obtain the total number of spanning trees in B/sub n/ and hence an approximate measure for network reliability.<>
京公网安备 11010802042870号
京ICP备2023020795号-1
分享
![[1990] Proceedings. The Twenty-Second Southeastern Symposium on System Theory](/Content/css/sci/img/zetp.jpg)
求助内容：
应助结果提醒方式：
扫码关注我们
