loading...
Hybrid Maximal Matching for Input Buffered Crossbar Switches
Fredericton, New Brunswick, Canada May 14-May 17
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/CNSR.2007.36Fifth Annual Conference on Communicat ...
 This Article 
 
PDF
HTML
 
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Choudhury A. Al Sayeed, University of Ottawa, ON, Canada
Dewan Tanvir Ahmed, University of Ottawa, ON, Canada
Akbar Ghaffar Pour Rahbar, University of Ottawa, ON, Canada
To alleviate the problems of network bottleneck in high speed networks, it is important to have faster switching and certainly efficient scheduling algorithms. Optical switches are becoming more popular because of their faster switching speeds and higher reliability as compared to their electronic counterpart. Suitable scheduling algorithms are needed to be developed that will improve the utilization of the switch bandwidth, as well as reduce the scheduling overhead. However, most of the present scheduling algorithms try to optimize either the switch bandwidth or the overhead. In this paper, we propose one new scheduling algorithm named as Hybrid Maximal Matching (HMM) that provides a perfect balance between these two performance criteria and proves itself suitable for large size optical switches. The proposed HMM algorithm is simple to implement and arrives with a complexity of at most O(N5) for an NxN input queued crossbar switch.
Citation:
Choudhury A. Al Sayeed, Dewan Tanvir Ahmed, Akbar Ghaffar Pour Rahbar, "Hybrid Maximal Matching for Input Buffered Crossbar Switches," cnsr, pp.397-403, Fifth Annual Conference on Communication Networks and Services Research (CNSR '07), 2007
Usage of this product signifies your acceptance of the Terms of Use.