By Topic

Hierarchical round-robin matching for virtual output queuing 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

2 Author(s)
Baranowska, A. ; Inst. of Electron. & Telecommun., Poznan Univ. of Technol., Poland ; Kabacinski, W.

We propose a new scheduling algorithm for VOQ switches called hierarchical round-robin matching (HRRM). Performance evaluation of the proposed algorithm under four different traffic models is given and compared with other well-known algorithms. Simulation results show that HRRM performs well for different types of traffic. It achieves 100% throughput under uniformly distributed traffic, and provides over 95% throughput under several non-uniformly distributed traffic patterns. Special attention should be paid to short packet awaiting time for each load under uniformly distributed traffic, and for a load lower than about 0.8 under non-uniformly distributed traffic.

Published in:

Telecommunications, 2005. advanced industrial conference on telecommunications/service assurance with partial and intermittent resources conference/e-learning on telecommunications workshop. aict/sapir/elete 2005. proceedings

Date of Conference:

17-20 July 2005