首页    期刊浏览 2024年11月27日 星期三
登录注册

文章基本信息

  • 标题:A Challenge for Routing Algorithms in Optical Multistage Interconnection Networks
  • 本地全文:下载
  • 作者:Moudi, Mehrnaz ; Othman, Mohamed
  • 期刊名称:Journal of Computer Science
  • 印刷版ISSN:1549-3636
  • 出版年度:2011
  • 卷号:7
  • 期号:11
  • 页码:1685-1690
  • 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.
  • 关键词: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)
国家哲学社会科学文献中心版权所有