THE HELICAL CUBE NETWORK

The binary cube is a popular interconnection structure due to its desi rable properties such as symmetry, regularity, low diameter, and high fault-tolerance characteristics. The biggest drawback of this structur e, however, is that the number of nodes in this structure grows only a s an integer power of two. To remove this deficiency, a number of alte rnatives have been suggested, each with some limitations. In this pape r, we introduce a variation of this interconnection structure called t he helical cube. The proposed structure with K nodes strives to preser ve all desirable properties of the binary cube such as regularity, sim plicity of routing, and fault tolerance (connectivity of the graph). I t removes the restriction on the number of nodes being a power of two while maintaining connectivity c, where [log K] less than or equal to [log K]. The degree of each node remains either [log K] or [log K] dep ending on the location of a node and total number of nodes in the stru cture. (C) 1995 John Wiley and Sons, Inc.