Routing algorithm in FQn with a large number of faulty nodes

This paper, we propose a routing algorithm in FQ_n with large number of faulty nodes under assumption that FQ_n is local k-sub-folded-hypercube-connectivity. Based on the algorithm, at least K = min(D_k(u), D_k(v)) disjoint paths can be found, and each has the length bounded by (d(U_k, V_k) + 3)2^k. u and v are the source and destination respectively. D_k(u) and D_k(v) represent the number of non-faulty neighbors of U and V respectively (not considering the internal non-faulty neighbors of U and V in U_k and V_k). d(U_k, V_k) stands for the distance between two basic k-sub-folded-hypercube U_k and V_k. This routing algorithm is distributed and local-information-based that each node in FQ_n knows only its neighbors´ status but no global information is required. So it has strong sense and application in real life.