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.

In this paper, a fast and efficient crosstalk-free routing algorithm is proposed to enhance message routing in optical multistage interconnection networks (OMINs). The new Fast ZeroXY algorithm is designed based on the Zero algorithms, which uses the time dilation approach to eliminate the negative effect of crosstalk associated with optical switching in the optical Omega network. To evaluate the performance of the new algorithm, a crosstalk-free version of the original ZeroXY algorithm is developed extended from the Improved ZeroXY algorithm, called the Modified ZeroXY algorithm. The Fast ZeroXY algorithm is shown to efficiently route permutations without crosstalk with improved routing time compared to the original crosstalk-free ZeroXY algorithm.

Limited by the properties of optical signals, it is not possible to route more than one message simultaneously, without optical crosstalk, over a switching element in an Optical Multistage Interconnection Networks (OMINs). One solution, called the time domain approach, avoids optical crosstalk by arranging the permutation in such a way that a set of crosstalk-free connections can be established and each connection set be made active in different time slots. Based on the Zero algorithms, we proposed a fast and efficient crosstalk-free algorithm for message routing in optical Omega multistage networks. The Bitwise Window Method (BWM) is used to identify potential message conflicts that may further lead to optical crosstalk. In addition, the inverse Conflict Matrix (iCM) is used to map identified conflicts between messages in the network. It is shown that the new algorithm successfully improved the execution time in comparison to the original Zero algorithm.

In this paper, we explore the idea of integrating the Remove Last Pass (RLP) algorithm to the Fast Zero (FastZ) algorithm as the prior initial solution to improve routing performance in optical multistage interconnection networks (OMINs). OMINs are popular for its costeffectiveness and self-routable characteristics to meet the demand for high speed switching capability. A great challenge in dealing with OMINs is the optical crosstalk caused by optical signal coupling when propagating through the switching elements comprising the architecture. Many algorithms have been developed to solve optical crosstalk using different approaches. The new Fast Zero with RLP (FastRLP) algorithm is developed based on the time domain approach for solving optical crosstalk in the optical Omega network. Simulation results have shown that integrating RLP to FastZ algorithm successfully improved routing performance.

Based on the ZeroX algorithm, we proposed a fast and efficient crosstalk-free algorithm called the Fast ZeroX algorithm for solving optical crosstalk problem in Omega networks. In our approach, we introduced the concept of inverse Conflict Matrix (iCM), another representation of a conflict matrix in which it summarizes all possible conflicts between each node in the network. Using iCM, the ZeroX algorithm is simplified, thus improved by reducing the time needed for routing process. From our simulation results, it is shown that our approach yields better performance in terms of minimal routing time in comparison to the original ZeroX algorithm.