IETQ: An incrementally extensible twisted cube
In this paper, a new family of interconnection networks which we call the Incrementally Extensible Twisted Cube (IETQ) is proposed. The topology of this network is a novel generalization of the twisted cube. It inherits all the merits but without the limitations owned by a twisted cube. First; this proposed IETQ is incrementally extensible and can be adapted for use in any number of nodes; therefore; this network is particularly well suited for the design of a distributed communication network with an arbitrary number of nodes. Second, the vertex connectivity of IETQ is n. Measured by this vertex connectivity, we demonstrate that this network is optimally fault-tolerant. And it is almost regular, because the difference between the maximum and minimum degree of any node in an IETQ is at most. one. A shortest-path routing algorithm for IETQ is proposed to generate path for any given pair of vertices in the network. Third, comparing with most of the other competitors, the diameter of this IETQ network is only half in size. This low diameter helps to reduce the internode communication delay. moreover, IETQ also possesses the property of a pancyclic network. This attractive property would enable us to map rings of any length into the proposed network.
twisted cube connectivity diameter pancyclic hamiltonian hamiltonian connected