Node-to-Set Disjoint-Path Routing in Hierarchical Cubic Networks

Hypercubes are a simple topology frequently used as interconnection network of parallel systems. However, hypercubes connecting a significant number of nodes also have an impractically high number of edges. To address this issue, Ghose and Desai introduced a new topology, hierarchical cubic networks, containing almost half many edges than a hypercube of the same size. In this paper, we describe a node-to-set disjoint-path routing algorithm in a hierarchical cubic network HCN(n) finding node-disjoint paths between one source node and k (k≤n+1) destination nodes in O(knlog k) time complexity. Generated paths have lengths of at most 3n+k+3.