A challenge for routing algorithms in optical multistage interconnection networks
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 o...
Saved in:
Main Authors: | Moudi, Mehrnaz, Othman, Mohamed |
---|---|
Format: | Article |
Language: | English |
Published: |
Science Publications
2011
|
Online Access: | http://psasir.upm.edu.my/id/eprint/22518/1/A%20challenge%20for%20routing%20algorithms%20in%20optical%20multistage%20interconnection%20networks.pdf http://psasir.upm.edu.my/id/eprint/22518/ http://www.thescipub.com/abstract/10.3844/jcssp.2011.1685.1690 |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Similar Items
-
A GreedyZero algorithm to minimise the conflicts in an Optical Multistage Interconnection Network
by: Moudi, Mehrnaz, et al.
Published: (2014) -
A cost-effective architecture for optical multistage interconnection network.
by: Moudi, Mehrnaz, et al.
Published: (2013) -
Greedyzero-based scheduling algorithm to route in optical low stage interconnection networks
by: Moudi, Mehrnaz
Published: (2012) -
Fast zerox algorithm for routing in optical multistage interconnection networks.
by: T.D. , Shahida, et al.
Published: (2010) -
Bitwise-based Routing Algorithms in Optical Multistage Interconnection Network
by: Abed, Farzaneh
Published: (2007)