Embedding Long Paths in k-Ary n-Cubes with Faulty Nodes and Links
Iain A. Stewart, Yonghong Xiang · IEEE Transactions on Parallel and Distributed Systems · 2008
Let k ges 4 be even and let n ges 2. Consider a faulty k-ary n-cube Qknin which the number of node faults fv and the number of link faults feare such that fv+ feles 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- 2 fv-1 (respectively, kn- 2 fv-2) if the nodes s and e have different (respectively the same) parities (the parity of a node in Qknis 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 et al. (2007) and by Fu (2006). Furthermore, we extend known results, obtained by Kim and Park (2000), for the case when n=2.