Research Article Open Access

A Challenge for Routing Algorithms in Optical Multistage Interconnection Networks

Mehrnaz Moudi and Mohamed Othman

Abstract

Problem statement: A class of dynamic interconnection networks is Multistage Interconnection Networks (MINs) that connects input devices to output devices through a number of switch stages. MINs have assumed importance in recent years; because of their cost-effectiveness. Optical MINs are one type of MINs that have large transmission capacity in the communication networks. There is a major problem in Optical MIN that is crosstalk, which is caused by coupling two signals within a switching element. Approach: To avoid crosstalk in Optical MINs many algorithms have been proposed by many researchers that we review applying five routing algorithms and scheduling them in the Optical MINs. Results: The comparative results of routing algorithms show affective of avoiding crosstalk in number of passes and execution time for different algorithm. Conclusion: The challenge between these routing algorithms is thoroughly investigated, by applying them on Optical MIN and showing which algorithm has better performance to avoid crosstalk.

Journal of Computer Science
Volume 7 No. 11, 2011, 1685-1690

DOI: https://doi.org/10.3844/jcssp.2011.1685.1690

Submitted On: 1 August 2011 Published On: 29 August 2011

How to Cite: Moudi, M. & Othman, M. (2011). A Challenge for Routing Algorithms in Optical Multistage Interconnection Networks. Journal of Computer Science, 7(11), 1685-1690. https://doi.org/10.3844/jcssp.2011.1685.1690

  • 2,657 Views
  • 2,375 Downloads
  • 10 Citations

Download

Keywords

  • Optical multistage interconnection networks
  • routing algorithm
  • switching element
  • Multistage Interconnection Networks (MINs)
  • Switching Elements (SEs)
  • Multilayer Multistage Interconnection Networks (MLMINs)
  • Simulated Annealing (SA)
  • Genetic Algorithm (GA)