By Topic

Scheduling algorithms for input-queued switches with virtual output queueing

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)
Liu, N.H. ; Dept. of Electron. Eng., City Univ. of Hong Kong, China ; Yeung, K.L. ; Pao, D.C.W.

A set of packet scheduling algorithms are proposed for improving the performance of an iterative longest port first (iLPF) algorithm for virtual output queueing (VOQ) switches. In our proposed algorithms, scheduling priority is given according to different criteria that include input port occupancy, output port occupancy and critical port in VOQ. One of the proposed algorithms, called longest input port first with throughput maximization (LIPF with TM), gives significant performance improvement in mean packet delay and throughput when compared with iLPF. We found that for a 16×16 switch with input load p=0.85, the mean packet delay is 7.08 slots for iLPF and 3.21 slots for LIPF with TM. This represents a 55% cut in mean packet delay

Published in:

Communications, 2001. ICC 2001. IEEE International Conference on  (Volume:7 )

Date of Conference: