Set-to-Set Disjoint Paths Routing in Dual-Cubes

In this paper, we propose an efficient algorithm that finds disjoint paths for set-to-set routing in a dual-cube. A dual-cube is a hypercube-like interconnection network with about half of links per node compared with the hypercube containing equal number of nodes. For a dual-cube D_n with n links per node, the algorithm finds n disjoint paths, node s_irarrt_j (1 les i, j les n), s_i isin S, tj isin T, in O (n² log n) time and the maximum length of the paths is bounded by 3n + 3.