The node-to-set disjoint paths problem in a k-connected network is to find k paths from a source node s to a set of k target nodes \(T=\{t_1, t_2, \dots , t_k\}\) , with \(s \notin T\) , such that each arbitrary pair of paths has no joint nodes except for the starting node s. According to Menger’s theorem, there must exist k node-disjoint paths if the network is k-connected. With the expansion of the scale of networks, disjoint paths are playing an increasingly important role in high-performance computing, parallel data processing, fault tolerance and secure data transmission. As a promising candidate for the underlying topology of interconnection networks in massively parallel systems, the n-dimensional divide-and-swap cube, or \(\text {DSC}_n\) , is a newly proposed hypercube variant which possesses some desirable properties. In this paper, we mainly study the reliable communication of \(\text {DSC}_n\) in terms of node-to-set disjoint paths. We construct \(d+1\) node-to-set disjoint paths in \(\text {DSC}_n\) , whose lengths are at most 8 for \(n=4\) , and \(\frac{5n}{4} + 5\) for \(n \ge 8\) . Moreover, we estimate the average and maximum lengths of these paths based on a computer experiment. The results show that the experimental maximum path lengths are almost equal to the theoretical maximum path lengths when \(n \le 32\) . When \(n \ge 64\) , however, the theoretical maximum path lengths cannot be attained easily.
