DIAGNOSABILITY OF CROSSED CUBES UNDER TWO STRATEGIES
Jianxi Fan · Chinese Journal of Computers · 1998
The degree of diagnosability of an interconnection network is an impor-tant standard to measure the properties of the network- Crossed cubes which havebeen proposed recently are a kind of interconnection networks,possessing some bet-ter natures than hypercubes. This paper proves that n-dimensional crossed cube D.is n-diagnosable and (2n - 2)/(2n - 2)-diagnosable respectively under the precisestrategy and the pessimistic strategy by using the PMC model. Thus, it proves thatthe degrees of diagnosability of Dn are the same as those of n-dimensional hypercubeunder the two strategies- In the course of proving that D is n-diagnosable in thispaper, n disjoint paths between any two nodes in D. are gained, which may be treat-ed as the basis of fault tolerant routing.