Scheduling algorithms for input-queued switches with virtual output queueing

Research output: Journal Publications and Reviews (RGC: 21, 22, 62)22_Publication in policy or professional journal

10 Scopus Citations
View graph of relations

Author(s)

Related Research Unit(s)

Detail(s)

Original languageEnglish
Pages (from-to)2038-2042
Journal / PublicationIEEE International Conference on Communications
Volume7
Publication statusPublished - 2001

Conference

TitleInternational Conference on Communications (ICC2001)
PlaceFinland
CityHelsinki
Period11 - 14 June 2001

Abstract

A set of packet scheduling algorithms are proposed for improving the performance of Iterative Longest Port First (iLPF) algorithm in [1] for Virtual Output Queueing Switch. 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 our proposed algorithm, 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.