In this paper, routing properties of cube-based optoelectronic OTIS networks are explored. We show emulations of various cubical network topologies on their OTIS augmented variants, including the n-D grid networks, shuffle-exchange, and de Brujin networks. An analytical performance model for OTIS-cube networks is proposed. The model is validated by means of comparison with rigorously obtained simulation results. Using this model, the performance characteristics of the OTIS-hypercube network are evaluated in view of a number of different constraints. Moreover, we compare the performance characteristics of the OTIS-hypercube with that of equivalent fully-electronic networks under various implementation constraints.
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
Hashem Hashemi NAJAF-ABADI, Hamid SARBAZI-AZAD, "Analytic Performance Evaluation of OTIS-Hypercubes" in IEICE TRANSACTIONS on Information,
vol. E89-D, no. 2, pp. 441-451, February 2006, doi: 10.1093/ietisy/e89-d.2.441.
Abstract: In this paper, routing properties of cube-based optoelectronic OTIS networks are explored. We show emulations of various cubical network topologies on their OTIS augmented variants, including the n-D grid networks, shuffle-exchange, and de Brujin networks. An analytical performance model for OTIS-cube networks is proposed. The model is validated by means of comparison with rigorously obtained simulation results. Using this model, the performance characteristics of the OTIS-hypercube network are evaluated in view of a number of different constraints. Moreover, we compare the performance characteristics of the OTIS-hypercube with that of equivalent fully-electronic networks under various implementation constraints.
URL: https://global.ieice.org/en_transactions/information/10.1093/ietisy/e89-d.2.441/_p
Copy
@ARTICLE{e89-d_2_441,
author={Hashem Hashemi NAJAF-ABADI, Hamid SARBAZI-AZAD, },
journal={IEICE TRANSACTIONS on Information},
title={Analytic Performance Evaluation of OTIS-Hypercubes},
year={2006},
volume={E89-D},
number={2},
pages={441-451},
abstract={In this paper, routing properties of cube-based optoelectronic OTIS networks are explored. We show emulations of various cubical network topologies on their OTIS augmented variants, including the n-D grid networks, shuffle-exchange, and de Brujin networks. An analytical performance model for OTIS-cube networks is proposed. The model is validated by means of comparison with rigorously obtained simulation results. Using this model, the performance characteristics of the OTIS-hypercube network are evaluated in view of a number of different constraints. Moreover, we compare the performance characteristics of the OTIS-hypercube with that of equivalent fully-electronic networks under various implementation constraints.},
keywords={},
doi={10.1093/ietisy/e89-d.2.441},
ISSN={1745-1361},
month={February},}
Copy
TY - JOUR
TI - Analytic Performance Evaluation of OTIS-Hypercubes
T2 - IEICE TRANSACTIONS on Information
SP - 441
EP - 451
AU - Hashem Hashemi NAJAF-ABADI
AU - Hamid SARBAZI-AZAD
PY - 2006
DO - 10.1093/ietisy/e89-d.2.441
JO - IEICE TRANSACTIONS on Information
SN - 1745-1361
VL - E89-D
IS - 2
JA - IEICE TRANSACTIONS on Information
Y1 - February 2006
AB - In this paper, routing properties of cube-based optoelectronic OTIS networks are explored. We show emulations of various cubical network topologies on their OTIS augmented variants, including the n-D grid networks, shuffle-exchange, and de Brujin networks. An analytical performance model for OTIS-cube networks is proposed. The model is validated by means of comparison with rigorously obtained simulation results. Using this model, the performance characteristics of the OTIS-hypercube network are evaluated in view of a number of different constraints. Moreover, we compare the performance characteristics of the OTIS-hypercube with that of equivalent fully-electronic networks under various implementation constraints.
ER -