Performance of exhaustive matching algorithms for input-queued switches

Yoohwan Kim, H. Jonathan Chao

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Abstract

Virtual output queue (VOQ) architecture is commonly used for avoiding head-of-line blocking in input-queued switches. Many algorithms have been developed for transferring the cells from the VOQs to the output ports. Traditional iterative algorithms such as iSLIP and DRRM, achieve 100% throughput under uniform traffic. But under non-uniform traffic, throughput drops significantly. Recently, a new paradigm of exhaustive matching (EM) has been introduced for handling non-uniform traffic while preserving the complexity of traditional iterative algorithms. In EM, a VOQ is served continuously until it becomes empty. Only the input ports that have finished serving a VOQ look for a new match. This strategy produces very good throughput and delay performance in uniform and non-uniform traffic. However under some traffic patterns, there is a starvation problem when a VOQ occupies an output port for an extended period of time. This problem can be eliminated by providing a priority service for a VOQ that has waited an excessively long time. The resulting algorithm, prioritized EM (PEM), eliminates starvation and achieves very high throughput for many traffic patterns.

Original languageEnglish (US)
Title of host publicationIEEE International Conference on Communications
Pages1817-1822
Number of pages6
Volume3
StatePublished - 2003
Event2003 International Conference on Communications (ICC 2003) - Anchorage, AK, United States
Duration: May 11 2003May 15 2003

Other

Other2003 International Conference on Communications (ICC 2003)
CountryUnited States
CityAnchorage, AK
Period5/11/035/15/03

Fingerprint

Switches
Throughput

Keywords

  • Exhaustive service
  • Matching
  • Scheduling
  • Switch
  • Virtual Output Queueing

ASJC Scopus subject areas

  • Media Technology

Cite this

Kim, Y., & Chao, H. J. (2003). Performance of exhaustive matching algorithms for input-queued switches. In IEEE International Conference on Communications (Vol. 3, pp. 1817-1822)

Performance of exhaustive matching algorithms for input-queued switches. / Kim, Yoohwan; Chao, H. Jonathan.

IEEE International Conference on Communications. Vol. 3 2003. p. 1817-1822.

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Kim, Y & Chao, HJ 2003, Performance of exhaustive matching algorithms for input-queued switches. in IEEE International Conference on Communications. vol. 3, pp. 1817-1822, 2003 International Conference on Communications (ICC 2003), Anchorage, AK, United States, 5/11/03.
Kim Y, Chao HJ. Performance of exhaustive matching algorithms for input-queued switches. In IEEE International Conference on Communications. Vol. 3. 2003. p. 1817-1822
Kim, Yoohwan ; Chao, H. Jonathan. / Performance of exhaustive matching algorithms for input-queued switches. IEEE International Conference on Communications. Vol. 3 2003. pp. 1817-1822
@inproceedings{e617829ab802400d88c4061fed51e263,
title = "Performance of exhaustive matching algorithms for input-queued switches",
abstract = "Virtual output queue (VOQ) architecture is commonly used for avoiding head-of-line blocking in input-queued switches. Many algorithms have been developed for transferring the cells from the VOQs to the output ports. Traditional iterative algorithms such as iSLIP and DRRM, achieve 100{\%} throughput under uniform traffic. But under non-uniform traffic, throughput drops significantly. Recently, a new paradigm of exhaustive matching (EM) has been introduced for handling non-uniform traffic while preserving the complexity of traditional iterative algorithms. In EM, a VOQ is served continuously until it becomes empty. Only the input ports that have finished serving a VOQ look for a new match. This strategy produces very good throughput and delay performance in uniform and non-uniform traffic. However under some traffic patterns, there is a starvation problem when a VOQ occupies an output port for an extended period of time. This problem can be eliminated by providing a priority service for a VOQ that has waited an excessively long time. The resulting algorithm, prioritized EM (PEM), eliminates starvation and achieves very high throughput for many traffic patterns.",
keywords = "Exhaustive service, Matching, Scheduling, Switch, Virtual Output Queueing",
author = "Yoohwan Kim and Chao, {H. Jonathan}",
year = "2003",
language = "English (US)",
volume = "3",
pages = "1817--1822",
booktitle = "IEEE International Conference on Communications",

}

TY - GEN

T1 - Performance of exhaustive matching algorithms for input-queued switches

AU - Kim, Yoohwan

AU - Chao, H. Jonathan

PY - 2003

Y1 - 2003

N2 - Virtual output queue (VOQ) architecture is commonly used for avoiding head-of-line blocking in input-queued switches. Many algorithms have been developed for transferring the cells from the VOQs to the output ports. Traditional iterative algorithms such as iSLIP and DRRM, achieve 100% throughput under uniform traffic. But under non-uniform traffic, throughput drops significantly. Recently, a new paradigm of exhaustive matching (EM) has been introduced for handling non-uniform traffic while preserving the complexity of traditional iterative algorithms. In EM, a VOQ is served continuously until it becomes empty. Only the input ports that have finished serving a VOQ look for a new match. This strategy produces very good throughput and delay performance in uniform and non-uniform traffic. However under some traffic patterns, there is a starvation problem when a VOQ occupies an output port for an extended period of time. This problem can be eliminated by providing a priority service for a VOQ that has waited an excessively long time. The resulting algorithm, prioritized EM (PEM), eliminates starvation and achieves very high throughput for many traffic patterns.

AB - Virtual output queue (VOQ) architecture is commonly used for avoiding head-of-line blocking in input-queued switches. Many algorithms have been developed for transferring the cells from the VOQs to the output ports. Traditional iterative algorithms such as iSLIP and DRRM, achieve 100% throughput under uniform traffic. But under non-uniform traffic, throughput drops significantly. Recently, a new paradigm of exhaustive matching (EM) has been introduced for handling non-uniform traffic while preserving the complexity of traditional iterative algorithms. In EM, a VOQ is served continuously until it becomes empty. Only the input ports that have finished serving a VOQ look for a new match. This strategy produces very good throughput and delay performance in uniform and non-uniform traffic. However under some traffic patterns, there is a starvation problem when a VOQ occupies an output port for an extended period of time. This problem can be eliminated by providing a priority service for a VOQ that has waited an excessively long time. The resulting algorithm, prioritized EM (PEM), eliminates starvation and achieves very high throughput for many traffic patterns.

KW - Exhaustive service

KW - Matching

KW - Scheduling

KW - Switch

KW - Virtual Output Queueing

UR - http://www.scopus.com/inward/record.url?scp=0038308091&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=0038308091&partnerID=8YFLogxK

M3 - Conference contribution

AN - SCOPUS:0038308091

VL - 3

SP - 1817

EP - 1822

BT - IEEE International Conference on Communications

ER -