The search functionality is under construction.

The search functionality is under construction.

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 shortestpath 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.

- Publication
- IEICE TRANSACTIONS on Fundamentals Vol.E85-A No.5 pp.1140-1151

- Publication Date
- 2002/05/01

- Publicized

- Online ISSN

- DOI

- Type of Manuscript
- PAPER

- Category
- Graphs and Networks

The copyright of the original papers published on this site belongs to IEICE. Unauthorized use of the original or translated papers is prohibited. See IEICE Provisions on Copyright for details.

Copy

Jyh-Shan CHANG, Sao-Jie CHEN, Tzi-Dar CHIUEH, "IETQ: An Incrementally Extensible Twisted Cube" in IEICE TRANSACTIONS on Fundamentals,
vol. E85-A, no. 5, pp. 1140-1151, May 2002, doi: .

Abstract: 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 shortestpath 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.

URL: https://global.ieice.org/en_transactions/fundamentals/10.1587/e85-a_5_1140/_p

Copy

@ARTICLE{e85-a_5_1140,

author={Jyh-Shan CHANG, Sao-Jie CHEN, Tzi-Dar CHIUEH, },

journal={IEICE TRANSACTIONS on Fundamentals},

title={IETQ: An Incrementally Extensible Twisted Cube},

year={2002},

volume={E85-A},

number={5},

pages={1140-1151},

abstract={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 shortestpath 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.},

keywords={},

doi={},

ISSN={},

month={May},}

Copy

TY - JOUR

TI - IETQ: An Incrementally Extensible Twisted Cube

T2 - IEICE TRANSACTIONS on Fundamentals

SP - 1140

EP - 1151

AU - Jyh-Shan CHANG

AU - Sao-Jie CHEN

AU - Tzi-Dar CHIUEH

PY - 2002

DO -

JO - IEICE TRANSACTIONS on Fundamentals

SN -

VL - E85-A

IS - 5

JA - IEICE TRANSACTIONS on Fundamentals

Y1 - May 2002

AB - 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 shortestpath 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.

ER -