{"title":"Broadcasting in injured hypercubes using limited global information","authors":"Jie Wu","doi":"10.1109/SECON.1994.324332","DOIUrl":null,"url":null,"abstract":"We propose a fault-tolerant broadcasting algorithm in hypercubes with link faults. This algorithm is based on an extended spanning binomial tree structure which keeps the simplicity of conventional binomial tree-based broadcasting. Each node keeps limited information of nearby faulty links in terms of faulty adjacent subcubes. It is shown that under most circumstances, a broadcasting can be completed optimally in n steps except for a few cases with low probability which require n+1 steps.<<ETX>>","PeriodicalId":119615,"journal":{"name":"Proceedings of SOUTHEASTCON '94","volume":"1 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1994-04-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"5","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Proceedings of SOUTHEASTCON '94","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/SECON.1994.324332","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 5
Abstract
We propose a fault-tolerant broadcasting algorithm in hypercubes with link faults. This algorithm is based on an extended spanning binomial tree structure which keeps the simplicity of conventional binomial tree-based broadcasting. Each node keeps limited information of nearby faulty links in terms of faulty adjacent subcubes. It is shown that under most circumstances, a broadcasting can be completed optimally in n steps except for a few cases with low probability which require n+1 steps.<>
京公网安备 11010802042870号
京ICP备2023020795号-1
分享
求助内容：
应助结果提醒方式：
扫码关注我们
