The helical cube network
Arun K. Somani, Sanjay Thatte · Networks · 1995
Abstract The binary cube is a popular interconnection structure due to its desirable properties such as symmetry, regularity, low diameter, and high fault‐tolerance characteristics. The biggest drawback of this structure, however, is that the number of nodes in this structure grows only as an integer power of two. To remove this deficiency, a number of alternatives have been suggested, each with some limitations. in this paper, we introduce a variation of this interconnection structure called the helical cube. The proposed structure withKnodes strives to preserve all desirable properties of the binary cube such as regularity, simplicity of routing, and fault tolerance (connectivity of the graph). It removes the restriction on the number of nodes being a power of two while maintaining connectivityc, where ⌊logK⌋ ≤c≤ ⌈logK⌉. The degree of each node remains either ⌈logK⌉ or ⌊logK⌋ depending on the location of a node and total number of nodes in the structure.