Premium
The helical cube network
Author(s) -
Somani Arun K.,
Thatte Sanjay
Publication year - 1995
Publication title -
networks
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.977
H-Index - 64
eISSN - 1097-0037
pISSN - 0028-3045
DOI - 10.1002/net.3230260204
Subject(s) - interconnection , cube (algebra) , node (physics) , fault tolerance , mathematics , binary number , combinatorics , graph , degree (music) , computer science , routing (electronic design automation) , topology (electrical circuits) , discrete mathematics , algorithm , distributed computing , arithmetic , computer network , physics , acoustics , quantum mechanics
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 with K nodes 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 connectivity c , where ⌊log K ⌋ ≤ c ≤ ⌈log K ⌉. The degree of each node remains either ⌈log K ⌉ or ⌊log K ⌋ depending on the location of a node and total number of nodes in the structure.