Queues allocation for multiple input-queued switches

J. S.C. Wu, R. Miler, Tsern-Huei Lee, Ying-Dar Lin

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

Abstract

To meet the increasing requirement for high speed switches, a multiple input-queued (MIQ) switch is explored. Rather than handling the scheduling problem heavily focused on by many researchers, a proposed dynamic queue allocation algorithm is used to handle non-uniform or hot-spot traffic. Although the performance of the original algorithm is analyzed by N.K. Sharma and M.R. Pinnu (see Parallel Computing, vol.23, p.777-81, 1997) and the orderly property is enhanced by us, Wu and Lin, (see Parallel Computing, vol.24, p.2143-8, 1998), the correctness of the algorithm has not been proven yet. In this report, with the help of the inherent properties of FIFO queues, we prove that the algorithm, and the related MIQ switch, is free from deadlock.

Original languageAmerican English
Title of host publicationJoint 4th IEEE International Conference on ATM, ICATM 2001 and High Speed Intelligent Internet Symposium
PublisherInstitute of Electrical and Electronics Engineers Inc.
Pages143-147
Number of pages5
ISBN (Electronic)0780370937, 9780780370937
DOIs
StatePublished - 2001
Event4th IEEE International Conference on ATM, ICATM 2001 and High Speed Intelligent Internet Symposium - Seoul, Korea, Republic of
Duration: 22 Apr 200125 Apr 2001

Publication series

NameJoint 4th IEEE International Conference on ATM, ICATM 2001 and High Speed Intelligent Internet Symposium

Conference

Conference4th IEEE International Conference on ATM, ICATM 2001 and High Speed Intelligent Internet Symposium
Country/TerritoryKorea, Republic of
CitySeoul
Period22/04/0125/04/01

Fingerprint

Dive into the research topics of 'Queues allocation for multiple input-queued switches'. Together they form a unique fingerprint.

Cite this