By Topic

Performance analysis of Exhaustive Limited Service Round Robin Matching Algorithm

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

2 Author(s)
Radusinovic, I. ; University of Montenegro, Serbia & Montenegro ; Veljovic, Z.

In this paper a performance analysis of exhaustive round-robin with limited service (ELRR) scheduling algorithm for combined input-crosspoint crossbar switches is presented. We propose using of this scheduling system for arbitration at inputs and crosspoints. If the virtual output queue (crosspoint buffer) becomes empty, the input (crosspoint) arbiter updates its pointer to the next location in a fixed order. Otherwise, the pointer remains at the current virtual output queue (crosspoint buffer). To avoid unfairness under some extremely unbalanced traffic pattern limited service matching is presented. We prove through simulations that this scheduling algorithm offers a high performance. In addition to high throughput and excellent delay performance, the switch provides timing relaxation that allows high-speed scheduling and scalability. The analyses and simulations presented in this paper enable extension of previously published results in the sense of novel performance evaluation under different traffic conditions.

Published in:

Networking, International Conference on Systems and International Conference on Mobile Communications and Learning Technologies, 2006. ICN/ICONS/MCL 2006. International Conference on

Date of Conference:

23-29 April 2006