Node-to-Set Disjoint Paths Routing in Dual-Cube

In this paper, we propose an efficient algorithm that finds disjoint paths for node-to-set routing in dual-cube. 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, s rarr t
_i
, 1 les i les n, in 0(n
²
log n) time and the maximum length of the paths is bounded by 3n + 3.