Reliability Evaluation and Routing Integration in Shuffle Exchange Omega Network

Abstract

Multistage Interconnection Networks (MINs) are design to provide an effective communication in switching. Shuffle-exchange networks (SENs) have been widely considered as practical interconnection systems due to their size of it switching elements (SEs) and uncomplicated configuration. In this paper, the relationship between reliability performance and number of network size are compared in shuffle exchange network (SEN) and SEN with minus one stages (SEN-). There are three parameters used to measure the reliability performance on these networks which is terminal reliability, broadcast reliability and network reliability. An addition this paper also focused on comparing the algorithm based on SEN-to achieve the optimal routing time and the number of passes. The algorithms consist of six algorithms namely ZeroX, ZeroY, ZeroXbit, ZeroYbit, Sequential Increasing and Sequential Decreasing algorithm. This paper also shows the details of the illustrative examples used to explain each parameter measures. At the end of this chapter, the comparative analysis shows the performance of each parameters measures.

Crosstalk Free Routing in Optical Multistage Interconnection Networks using Fast Window Method

“…Now all the entries of matrix are separate in individual groups. ZeroX, ZeroY and ZeroXY are types of that algorithm working through summing the columns, rows or applying the summation to both row and columns [18]. There are other routing algorithms that solve the crosstalk problem in optical multistage interconnection network with other strategies like Genetic algorithm, Ant colony optimization algorithm [19] Simulated Annealing algorithm [20].…”