By Topic

Hybrid Maximal Matching for Input Buffered Crossbar Switches

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

3 Author(s)
Al Sayeed, C.A. ; Sch. of Inf. Technol. & Eng., Univ. of Ottawa, Ottawa, ON ; Ahmed, D.T. ; Rahbar, A.G.P.

To alleviate the problems of network bottleneck in 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 0(N) for an NxN input queued crossbar switch.

Published in:

Communication Networks and Services Research, 2007. CNSR '07. Fifth Annual Conference on

Date of Conference:

14-17 May 2007