Hex-Cell: Modeling, Topological Properties and Routing Algorithm
Ahmad Sharieh, King Abdulla, Mohammad Qatawneh, Wesam A. Almobaideen · 2008
This paper introduces a new class of interconnection networks referred to as HexCell. Amongst the attractive features of the proposed topology is the embedding capability of topological structures such as linear array, ring, tree and mesh. Hex-cell employs an efficient routing algorithm which requires less knowledge of the network interconnections and brings about less communication cost. These features make it a suitable candidate for general purpose applications. Hex-Cell is expandable in an incremental fashion with minimal cost due to its recursive structure. The comparison of Hex-Cell with other networks of interests in terms of degree, diameter, and network-cost establishes merits when compared with others.