CONNECTIVITY OF CARTESIAN PRODUCT DIGRAPHS AND FAULT-TOLERANT ROUTINGS OF GENERALIZED HYPERCUBE

在线阅读 下载PDF 导出详情
摘要 Inthispaper,theproblemoffault-tolerantroutingsinfault-tolerantnetworksisconsidered.Aroutinginanetworkassignstoeachorderedpairofnodesafixedpath.Allcommunicationamongnodesmustgoonthisrouting.Wheneitheranodeoralinkinafault-tolerantnetwork{ails,thecommunicationfromonenodetoanotherusingthisfaultyelementmustbesentviaoneormoreintermediatenodesalongasequenceofpathsdeterminedbythisrouting.Animportantandpracticalproblemishowtochoosearoutinginthenetworksuchthatintermediatenodestoensurecommunicationaresmallforanyfault-set,LetCdbeadirectedcycleoforderd.Inthispaper.Theauthor{irstdiscussesconnectivityofCartesianproductdigraphs,thenprovesthattheCartesianproductdigraphCd1×Cd2×…×Cdn(di≥2,1≤i≤n)hasaroutingsuchthatatmostoneintermediatenodeisneededtoensuretransmissionofmessagesamongallnon-faultynodessolongasthenumberoffaultsislessthann,ThisisageneralizationofDolevetal'sresultforthen-dimensionalcuhe.
机构地区 不详
出版日期 1998年02月12日(中国期刊网平台首次上网日期,不代表论文的发表时间)
  • 相关文献