A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is
The hierarchical cubic network (HCN), which takes hypercubes as basic clusters, was first introduced in . Compared with the hypercube of the same size, the HCN requires only about half the number of links and provides a lower diameter. This paper first proposes a shortest-path routing algorithm and an optimal broadcasting algorithm for the HCN. We then show that the HCN is optimal fault tolerant by constructing node-disjoint paths between any two nodes, and demonstrate that the HCN isdoi:10.1016/1383-7621(96)00019-7 fatcat:7tpfu33urjeajpa5hakag4mwd4