Subscribe

Issue No.08 - August (2008 vol.19)

pp: 1071-1085

ABSTRACT

Let k ≥ 4 be even and let n ≥ 2. Consider a faulty k-ary n-cube Qkn in which the number of node faults fv and the number of link faults fe are such that fn+fe ≤ 2n-2. We prove that given any two healthy nodes s and e of Qkn, there is a path from s to e of length at least kn-2fn-1 (resp. kn-2fn-2) if the nodes s and e have different (resp. the same) parities (the parity of a node in Qkn is the sum modulo 2 of the elements in the n-tuple over {0,1,...,k-1} representing the node). Our result is optimal in the sense that there are pairs of nodes and fault configurations for which these bounds cannot be improved, and it answers questions recently posed by Yang, Tan and Hsu, and by Fu. Furthermore, we extend known results, obtained by Kim and Park, for the case when n=2.

INDEX TERMS

Interconnection architectures, Fault tolerance

CITATION

Iain A. Stewart, Yonghong Xiang, "Embedding Long Paths in k-Ary n-Cubes with Faulty Nodes and Links",

*IEEE Transactions on Parallel & Distributed Systems*, vol.19, no. 8, pp. 1071-1085, August 2008, doi:10.1109/TPDS.2007.70787REFERENCES