By Topic

Mutual priority: a scheme for effective and efficient distributed schedulers for high-speed cell-based 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)
Xithalis, C. ; Dept. of Electr. & Comput. Eng., Patras Univ., Greece ; Gamvrili, M. ; Serpanos, D.N.

Distributed scheduling algorithms for cell-based virtual output queuing (VOQ) switches have led to high-performance schedulers. However, existing algorithms suffer from low service guarantees and a need for several iterations to provide high throughput. In this paper, we introduce the mutual priority concept, a new mechanism that addresses these issues. We prove that mutual priority algorithms achieve optimal service guarantee (N in an N × N switch) and lead to packet delays that outperform all existing algorithms with significant improvements: the delay achieved by the most efficient mutual priority algorithm is 4.5 times lower for high loads (i.e., reduced by 78%) than the delay achieved by the best existing scheduler for a single iteration execution, while for log N iterations the improved delay is 2.5 times lower (i.e., reduced by 60%). Importantly, mutual priority schedulers provide significantly high performance with a single iteration, outperforming all alternatives and achieving performance comparable to that with multiple iterations.

Published in:

High Performance Switching and Routing, 2005. HPSR. 2005 Workshop on

Date of Conference:

12-14 May 2005