This paper proposes a parallel routing algorithm with time complexity of o(n2) for crossed cube networks,which can output three paths P0,P1,P2 between the source node u and the destination node v,such that:(1)|P0|=the distance between u and v;

• 该文提出了一种时间复杂度为o(n2)的交叉立方体网络并行路由算法,可输出源点u到目的点v的3条并行路径P0,P1,P2,并且满足:(1)|P0|=u到v的距离;