Diagnosability of the Möbius Cubes

• Authors: Jianxi Fan
• Venue: IEEE Transactions on Parallel and Distributed Systems
• Year: 1998

The recently introduced interconnection networks, the Möbius cubes, are hypercube variants that have some better properties than hypercubes. The n-dimensional Möbius cube Mn is a regular graph with 2n nodes and n2n驴1 edges. The diameter of Mn is about one half that of the n-dimensional hypercube Qn and the average number of steps between nodes for Mn is about two-thirds of the average for Qn, and 1 $-$Mn has dynamic performance superior to that of Qn [1]. Of course, the symmetry of Mn is not superior to that of Qn, i.e., Qn is both node symmetric and edge symmetric [11], whereas Mn is, in general, neither node symmetric (n驴 4) nor edge symmetric (n驴 3) [1]. In this paper, we study the diagnosability of Mn. We use two diagnosis strategies, both based on the so-called PMC diagnostic model驴the precise (one-step) diagnosis strategy proposed by Preparata et al. [10] and the pessimistic diagnosis strategy proposed by Friedman [9]. We show that the diagnosability of Mn is the same as that of Qn, i.e., Mn is n-diagnosable under the precise diagnosis strategy and (2n$-$ 2)/(2n$-$ 2)-diagnosable under the pessimistic diagnosis strategy.