折叠交叉立方体组合可靠性分析

S. Jena, P. Radhika, P. Reddy, G. Sowmya
{"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}
引用次数: 2

摘要

本文提出了一种计算折叠交叉立方体拓扑可靠度的有效组合方法。可靠性度量被定义为基于任务的可靠性(TBR)。该模型基于完全基于任务的分解原理,可以处理任何分解。利用递推方程得到的可靠性结果表明,乐观和悲观的可靠性都优于交叉立方体网络以及大多数其他网络。我们利用该方法生成了一些具有不同故障率和覆盖因子的高维互联网络的基于任务的可靠性。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
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.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:604180095
Book学术官方微信