Greedyzero-based scheduling algorithm to route in optical low stage interconnection networks
A class of dynamic interconnection networks is Multistage Interconnection Networks (MINs) that is popular in switching and communication applications. In recent years, MINs have assumed important because of their cost- effectiveness. The advances in electro-optic technologies have made significant...
Saved in:
Main Author: | Moudi, Mehrnaz |
---|---|
Format: | Thesis |
Language: | English |
Published: |
2012
|
Subjects: | |
Online Access: | http://psasir.upm.edu.my/id/eprint/39772/1/FSKTM%202012%2015R.pdf |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Similar Items
-
Crosstalk-Free Scheduling Algorithms for Routing in Optical Multistage Interconnection Networks
by: Raja Mohd Auzar, Tengku Dian Shahida
Published: (2009) -
Bitwise-based Routing Algorithms in Optical Multistage Interconnection Network
by: Abed, Farzaneh
Published: (2007) -
The application of metaheuristics in network routing and inventory routing problem /
by: Huda Zuhrah Ab Halim
Published: (2012) -
Fair bandwidth distribution marking and scheduling algorithm in network traffic classification
by: Al-Kharasani, Ameen Mohammed Abdulkarem
Published: (2019) -
Efficient Sequential and Parallel Routing Algorithms in Optical Multistage Interconnection Network
by: Abduh Kaid, Monir Abdullah
Published: (2005)