A Challenge for Routing Algorithms in Optical Multistage Interconnection Networks | Science Publications

Journal of Computer Science

Mehrnaz Moudi¹  Mohamed Othman¹ 

关键词: 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);   

DOI  :  10.3844/jcssp.2011.1685.1690

学科分类：计算机科学（综合）

来源: Science Publications

【 摘 要 】

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.

【 授权许可】

Unknown