Node-to-set and set-to-set cluster fault
โ
Qian-Ping Gu; Shietung Peng
๐
Article
๐
1998
๐
Elsevier Science
๐
English
โ 365 KB
We study node-to-set and set-to-set fault tolerant routing problems in n-dimensional hypercubes r n . Node-to-set routing problem is that given a node s and a set of nodes path connects a node of and a node of . From Menger's theorem, it is known that these two problems in r n can tolerate at most