Fast zerox algorithm for routing in optical multistage interconnection networks.

Citation

T.D. , Shahida and Othman, Mohamed and Abdullah, M. Khazani (2010) Fast zerox algorithm for routing in optical multistage interconnection networks. IIUM Engineering Journal, 11 (1). pp. 28-39. ISSN 1511-788X

Abstract

Based on the ZeroX algorithm, a fast and efficient crosstalk-free time- domain algorithm called the Fast ZeroX or shortly FastZ_X algorithm is proposed for solving optical crosstalk problem in optical Omega multistage interconnection networks. A new pre-routing technique called the inverse Conflict Matrix (iCM) is also introduced to map all possible conflicts identified between each node in the network as another representation of the standard conflict matrix commonly used in previous Zero-based algorithms. It is shown that using the new iCM, the original ZeroX algorithm is simplified, thus improved the algorithm by reducing the time to complete routing process. Through simulation modeling, the new approach yields the best performance in terms of minimal routing time in comparison to the original ZeroX algorithm as well as previous algorithms tested for comparison in this paper.

Download File

Preview

PDF (Abstract)
Fast zerox algorithm for routing in optical multistage interconnection networks.pdf
Download (83kB) | Preview

Additional Metadata

Item Type:	Article
Subject:	Computer algorithms.
Subject:	Computer networks.
Subject:	Optical processing.
Divisions:	Faculty of Computer Science and Information Technology
Keywords:	Optical multistage interconnection networks (OMINs); Zero-based routing algorithm; Heuristics sequential increase algorithm and time domain approach.
Depositing User:	Umikalthom Abdullah
Date Deposited:	14 May 2012 01:21
Last Modified:	19 Jan 2016 01:09
URI:	http://psasir.upm.edu.my/id/eprint/14721
Statistic Details:	View Download Statistic

Actions (login required)

View Item