A Routing Method for a Class of Cyclic Permutation Networks
Summary :
Some classes of hypercube structure and a routing method for them are presented in this paper. The first class of cyclic permutation networks (CPN1) is constructed by connecting input terminals with output terminals for permutation networks in accordance with a given rule. CPN1 is also a cyclic interchange graph of a hypercube, which is constructed by replacing each edge of the hypercube with a vertex and connecting the new adjacent vertices cyclically. The second class of cyclic permutation networks (CPN2) is constructed by splitting each vertex of CPN1 into two new vertices. The CPN2 is also graph-isomorphic to the CCC network. This paper also presents a routing method using the path coefficient for the cyclic permutation networks and the CCC network. For the cyclic networks, the path coefficient which determines the path from any source node (terminal) to the destination node can be expressed using only the binary representation of the destination node, and does not depend on the representation of the source node.
- Publication
- IEICE TRANSACTIONS on transactions Vol.E72-E No.2 pp.130-140
- Publication Date
- 1989/02/25
- Publicized
- Online ISSN
- DOI
- Type of Manuscript
- PAPER
- Category
- Computer Networks
Authors
Keyword
Latest Issue
Copyrights notice of machine-translated contents
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.
Cite this
Copy
Susumu SHIBUSAWA, "A Routing Method for a Class of Cyclic Permutation Networks" in IEICE TRANSACTIONS on transactions,
vol. E72-E, no. 2, pp. 130-140, February 1989, doi: .
Abstract: Some classes of hypercube structure and a routing method for them are presented in this paper. The first class of cyclic permutation networks (CPN1) is constructed by connecting input terminals with output terminals for permutation networks in accordance with a given rule. CPN1 is also a cyclic interchange graph of a hypercube, which is constructed by replacing each edge of the hypercube with a vertex and connecting the new adjacent vertices cyclically. The second class of cyclic permutation networks (CPN2) is constructed by splitting each vertex of CPN1 into two new vertices. The CPN2 is also graph-isomorphic to the CCC network. This paper also presents a routing method using the path coefficient for the cyclic permutation networks and the CCC network. For the cyclic networks, the path coefficient which determines the path from any source node (terminal) to the destination node can be expressed using only the binary representation of the destination node, and does not depend on the representation of the source node.
URL: https://global.ieice.org/en_transactions/transactions/10.1587/e72-e_2_130/_p
Copy
@ARTICLE{e72-e_2_130,
author={Susumu SHIBUSAWA, },
journal={IEICE TRANSACTIONS on transactions},
title={A Routing Method for a Class of Cyclic Permutation Networks},
year={1989},
volume={E72-E},
number={2},
pages={130-140},
abstract={Some classes of hypercube structure and a routing method for them are presented in this paper. The first class of cyclic permutation networks (CPN1) is constructed by connecting input terminals with output terminals for permutation networks in accordance with a given rule. CPN1 is also a cyclic interchange graph of a hypercube, which is constructed by replacing each edge of the hypercube with a vertex and connecting the new adjacent vertices cyclically. The second class of cyclic permutation networks (CPN2) is constructed by splitting each vertex of CPN1 into two new vertices. The CPN2 is also graph-isomorphic to the CCC network. This paper also presents a routing method using the path coefficient for the cyclic permutation networks and the CCC network. For the cyclic networks, the path coefficient which determines the path from any source node (terminal) to the destination node can be expressed using only the binary representation of the destination node, and does not depend on the representation of the source node.},
keywords={},
doi={},
ISSN={},
month={February},}
Copy
TY - JOUR
TI - A Routing Method for a Class of Cyclic Permutation Networks
T2 - IEICE TRANSACTIONS on transactions
SP - 130
EP - 140
AU - Susumu SHIBUSAWA
PY - 1989
DO -
JO - IEICE TRANSACTIONS on transactions
SN -
VL - E72-E
IS - 2
JA - IEICE TRANSACTIONS on transactions
Y1 - February 1989
AB - Some classes of hypercube structure and a routing method for them are presented in this paper. The first class of cyclic permutation networks (CPN1) is constructed by connecting input terminals with output terminals for permutation networks in accordance with a given rule. CPN1 is also a cyclic interchange graph of a hypercube, which is constructed by replacing each edge of the hypercube with a vertex and connecting the new adjacent vertices cyclically. The second class of cyclic permutation networks (CPN2) is constructed by splitting each vertex of CPN1 into two new vertices. The CPN2 is also graph-isomorphic to the CCC network. This paper also presents a routing method using the path coefficient for the cyclic permutation networks and the CCC network. For the cyclic networks, the path coefficient which determines the path from any source node (terminal) to the destination node can be expressed using only the binary representation of the destination node, and does not depend on the representation of the source node.
ER -
English
