{"title":"折叠交叉立方体组合可靠性分析","authors":"S. Jena, P. Radhika, P. Reddy, G. Sowmya","doi":"10.1109/PDGC.2012.6449901","DOIUrl":null,"url":null,"abstract":"This paper presents an efficient combinatorial approach to compute the reliability of Folded Crossed cube topology. The reliability measure has been defined as Task-based Reliability (TBR).The model is based on decomposition principle which is entirely task-based and can handle any degradation. The reliability results are obtained using recursive equation both optimistic and pessimistic are better than for the Crossed cube as well as for most of the other networks. We have utilized the method to generate the task-based reliability of some higher dimensional interconnection networks with various failure rates and coverage factors.","PeriodicalId":166718,"journal":{"name":"2012 2nd IEEE International Conference on Parallel, Distributed and Grid Computing","volume":"21 1 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2012-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"2","resultStr":"{\"title\":\"Combinatorial reliability analysis of Folded Crossed cube\",\"authors\":\"S. Jena, P. Radhika, P. Reddy, G. Sowmya\",\"doi\":\"10.1109/PDGC.2012.6449901\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"This paper presents an efficient combinatorial approach to compute the reliability of Folded Crossed cube topology. The reliability measure has been defined as Task-based Reliability (TBR).The model is based on decomposition principle which is entirely task-based and can handle any degradation. The reliability results are obtained using recursive equation both optimistic and pessimistic are better than for the Crossed cube as well as for most of the other networks. We have utilized the method to generate the task-based reliability of some higher dimensional interconnection networks with various failure rates and coverage factors.\",\"PeriodicalId\":166718,\"journal\":{\"name\":\"2012 2nd IEEE International Conference on Parallel, Distributed and Grid Computing\",\"volume\":\"21 1 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2012-12-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"2\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2012 2nd IEEE International Conference on Parallel, Distributed and Grid Computing\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/PDGC.2012.6449901\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2012 2nd IEEE International Conference on Parallel, Distributed and Grid Computing","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/PDGC.2012.6449901","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Combinatorial reliability analysis of Folded Crossed cube
This paper presents an efficient combinatorial approach to compute the reliability of Folded Crossed cube topology. The reliability measure has been defined as Task-based Reliability (TBR).The model is based on decomposition principle which is entirely task-based and can handle any degradation. The reliability results are obtained using recursive equation both optimistic and pessimistic are better than for the Crossed cube as well as for most of the other networks. We have utilized the method to generate the task-based reliability of some higher dimensional interconnection networks with various failure rates and coverage factors.