Integrating RLP and Fast Zero Algorithm to Improve Routing Performance in Optical Multistage Interconnection Networks

Abstract

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.

Reliability Evaluation and Routing Integration in Shuffle Exchange Omega Network

“…There were a lot of approaches and algorithms work efficiently in multistage interconnection network e.g. Crosstalk Free Modified Omega Network [8], Zero Algorithm [9], Fast Zero [10], Zerobit Algorithm [11], and Sequential Algorithm [12]. However, for this research purposes the routing algorithm used including the Zero algorithm, Zerobit algorithm and Sequential algorithm.…”

“…The RLP algorithm was executed if and only if the number of groups generated from the ZeroXbit and ZeroYbit algorithms was more than two, because there was no permutation that able to be routed in less than two groups without crosstalk in an optical Omega network regardless of the network size. Then, after one last pass successfully removed, the next last pass in line is removed if and only if there is one message in the pass [11].…”

The Development of Crosstalk-Free Scheduling Algorithms for Routing in Optical Multistage Interconnection Networks

“…However, the algorithm consumes longer execution time than other time domain algorithms. Apart from the algorithm's dependency to other algorithm to obtain the initial solution, the RLP algorithm also involves complex procedures when making scheduling decisions (Shahida, et al, 2008d, Shahida, 2009. -Shabi, 2005;Al-Shabi, et al, 2005 andAl-Shabi, et al, 2008), Zero algorithms perform best in terms of the execution time for scheduling the permutations and result very closely to the Degree Descending algorithm in terms of the number of passes generated to route a permutation.…”