This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Fault Diameter of k-ary n-cube Networks
September 1997 (vol. 8 no. 9)
pp. 903-907

Abstract—We obtain the fault diameter of k-ary n-cube interconnection networks (also known as n-dimensional k-torus networks). We start by constructing a complete set of node-disjoint paths (i.e., as many paths as the degree) between any two nodes of a k-ary n-cube. Each of the obtained paths is of length zero, two, or four plus the minimum length except for one path in a special case (when the Hamming distance between the two nodes is one) where the increase over the minimum length may attain eight. These results improve those obtained in [8] where the length of some of the paths has a variable increase (which can be arbitrarily large) over the minimum length. These results are then used to derive the fault diameter of the k-ary n-cube, which is shown to be Δ + 1 where Δ is the fault free diameter.

[1] Y. Saad and M. Schultz, "Topological Properties of Hypercubes," IEEE Trans. Computers, vol. 37, no. 7, pp. 867-872, July 1988.
[2] W. Dally and C. Seitz, "The Torus Routing Chip," Distributed Computing, pp. 187-196, 1986.
[3] L. Gravano, G.D. Pifarré, P.E. Berman, and J.L.C. Sanz, “Adaptive Deadlock- and Livelock-Free Routing with All Minimal Paths in Torus Networks,” IEEE Trans. Parallel and Distributed Systems, vol. 5, no. 12, pp. 1,233–1,251, Dec. 1994.
[4] L.N. Bhuyan and D.P. Agrawal, "Generalized Hypercube and Hyperbus Structures for a Computer Network," IEEE Trans. Computers, vol. 33, no. 4, pp. 323-333, Apr. 1984.
[5] S. Lakshmivarahan and S. Dhall, "A New Hierarchy of Hypercube Interconnection Schemes for Parallel Computers," J. Supercomputing, vol. 2, pp. 81-108, 1988.
[6] S.W. Graham and S.R. Seidel, "The Cost of Broadcasting on Star Graphs and K-ary Hypercubes," IEEE Trans. Computers, vol. 42, no. 6, pp. 756-759, June 1993.
[7] D.H. Linder and J.C. Harden, "An Adaptive and Fault Tolerant Wormhole Routing Strategy for k-Ary n-Cubes," IEEE Trans. Computers, vol. 40, no. 1, pp. 2-12, Jan. 1991.
[8] B. Bose, B. Broeg, Y. Kwon, and Y. Ashir, "Lee Distance and Topological Properties of k-Ary n-Cubes," IEEE Trans. Computers, vol. 44, no. 8, pp. 1,021-1,030, Aug. 1995.
[9] M.S. Krishnamoorty and B. Krishnamoorty, "Fault diameter of interconnection networks," Computers and Mathematics with Applications, vol. 13, no. 5-6, pp. 577-582, 1987.
[10] A.H. Esfahanian, “Generalized Measures of Fault Tolerance with Application to n-Cube Networks,” IEEE Trans. Computers, vol. 38, no. 11, pp. 1,586-1,591, 1989.
[11] S. Latifi, “Combinatorial Analysis of the Fault Diameter of the$n$-Cube,” IEEE Trans. Computers, vol. 42, no.1, pp. 27-33, 1993.
[12] S.B. Akers and B. Krishnamurthy, "The Fault Tolerance of Star Graphs," Second Int'l Conf. Supercomputing, 1987.
[13] F. Harary, Graph Theory, third edition. Addison-Wesley, 1972.

Index Terms:
Fault diameter, interconnection networks, k-ary n-cube, node-disjoint paths, torus.
Citation:
Khaled Day, Abdel Elah Al-Ayyoub, "Fault Diameter of k-ary n-cube Networks," IEEE Transactions on Parallel and Distributed Systems, vol. 8, no. 9, pp. 903-907, Sept. 1997, doi:10.1109/71.615436
Usage of this product signifies your acceptance of the Terms of Use.