Exhaustive service matching algorithms for input queued switches

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

Abstract

Virtual Output Queuing is widely used by fixed-length high-speed switches to overcome head-of-line blocking. This is done by means of matching algorithms. Maximum matching algorithms have good performance, but their implementation complexity is quite high. Maximal matching algorithms need speedup to guarantee good performance. Iterative matching schemes, such as iSLIP and DRRM, use multiple iterations to converge on a maximal match. The objective of matching algorithms is to reduce the matching overhead for each time slot. In this paper, Exhaustive Service Matching is presented as a way to amortize the cost of a match over multiple time slots, thus significantly improving switch performance. In an Exhaustive Service Matching switch, cells belonging to the same packet are transferred to the output continuously, which leads to good packet delay performance and simplifies the implementation of packet reassembly. To avoid unfairness under some extremely unbalanced traffic pattern, Limited Service Matching and Exhaustive Service Matching with Hamiltonian Walk (EMHW) are presented. We show that Limited Service Matching achieves better fairness under unbalanced traffic patterns, and in some cases improves the delay performance, while retaining low implementation complexity and a scalable architecture. We prove that EMHW is stable under all admissible traffic. All these schemes can be applied to existing matching algorithms, such as iSLIP and DRRM, to achieve high switching efficiency with low implementation complexities.

Original languageEnglish (US)
Title of host publication2004 Workshop on High Performance Switching and Routing, HPSR 2004
Pages253-258
Number of pages6
StatePublished - 2004
Event2004 Workshop on High Perfomance Switching and Routing, HPSR 2004 - Phoenix, AZ, United States
Duration: Apr 19 2004Apr 20 2004

Other

Other2004 Workshop on High Perfomance Switching and Routing, HPSR 2004
CountryUnited States
CityPhoenix, AZ
Period4/19/044/20/04

Fingerprint

Switches
Hamiltonians
Costs

Keywords

  • Exhaustive service
  • Hamiltonian walk
  • Limited service
  • Polling
  • Scheduling
  • Switching
  • Virtual Output Queueing

ASJC Scopus subject areas

  • Engineering(all)

Cite this

Li, Y., Panwar, S., & Chao, H. J. (2004). Exhaustive service matching algorithms for input queued switches. In 2004 Workshop on High Performance Switching and Routing, HPSR 2004 (pp. 253-258)

Exhaustive service matching algorithms for input queued switches. / Li, Yihan; Panwar, Shivendra; Chao, H. Jonathan.

2004 Workshop on High Performance Switching and Routing, HPSR 2004. 2004. p. 253-258.

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

Li, Y, Panwar, S & Chao, HJ 2004, Exhaustive service matching algorithms for input queued switches. in 2004 Workshop on High Performance Switching and Routing, HPSR 2004. pp. 253-258, 2004 Workshop on High Perfomance Switching and Routing, HPSR 2004, Phoenix, AZ, United States, 4/19/04.
Li Y, Panwar S, Chao HJ. Exhaustive service matching algorithms for input queued switches. In 2004 Workshop on High Performance Switching and Routing, HPSR 2004. 2004. p. 253-258
Li, Yihan ; Panwar, Shivendra ; Chao, H. Jonathan. / Exhaustive service matching algorithms for input queued switches. 2004 Workshop on High Performance Switching and Routing, HPSR 2004. 2004. pp. 253-258
@inproceedings{2574e0acc17a4fcd948fa2c9272d54c1,
title = "Exhaustive service matching algorithms for input queued switches",
abstract = "Virtual Output Queuing is widely used by fixed-length high-speed switches to overcome head-of-line blocking. This is done by means of matching algorithms. Maximum matching algorithms have good performance, but their implementation complexity is quite high. Maximal matching algorithms need speedup to guarantee good performance. Iterative matching schemes, such as iSLIP and DRRM, use multiple iterations to converge on a maximal match. The objective of matching algorithms is to reduce the matching overhead for each time slot. In this paper, Exhaustive Service Matching is presented as a way to amortize the cost of a match over multiple time slots, thus significantly improving switch performance. In an Exhaustive Service Matching switch, cells belonging to the same packet are transferred to the output continuously, which leads to good packet delay performance and simplifies the implementation of packet reassembly. To avoid unfairness under some extremely unbalanced traffic pattern, Limited Service Matching and Exhaustive Service Matching with Hamiltonian Walk (EMHW) are presented. We show that Limited Service Matching achieves better fairness under unbalanced traffic patterns, and in some cases improves the delay performance, while retaining low implementation complexity and a scalable architecture. We prove that EMHW is stable under all admissible traffic. All these schemes can be applied to existing matching algorithms, such as iSLIP and DRRM, to achieve high switching efficiency with low implementation complexities.",
keywords = "Exhaustive service, Hamiltonian walk, Limited service, Polling, Scheduling, Switching, Virtual Output Queueing",
author = "Yihan Li and Shivendra Panwar and Chao, {H. Jonathan}",
year = "2004",
language = "English (US)",
isbn = "0780383753",
pages = "253--258",
booktitle = "2004 Workshop on High Performance Switching and Routing, HPSR 2004",

}

TY - GEN

T1 - Exhaustive service matching algorithms for input queued switches

AU - Li, Yihan

AU - Panwar, Shivendra

AU - Chao, H. Jonathan

PY - 2004

Y1 - 2004

N2 - Virtual Output Queuing is widely used by fixed-length high-speed switches to overcome head-of-line blocking. This is done by means of matching algorithms. Maximum matching algorithms have good performance, but their implementation complexity is quite high. Maximal matching algorithms need speedup to guarantee good performance. Iterative matching schemes, such as iSLIP and DRRM, use multiple iterations to converge on a maximal match. The objective of matching algorithms is to reduce the matching overhead for each time slot. In this paper, Exhaustive Service Matching is presented as a way to amortize the cost of a match over multiple time slots, thus significantly improving switch performance. In an Exhaustive Service Matching switch, cells belonging to the same packet are transferred to the output continuously, which leads to good packet delay performance and simplifies the implementation of packet reassembly. To avoid unfairness under some extremely unbalanced traffic pattern, Limited Service Matching and Exhaustive Service Matching with Hamiltonian Walk (EMHW) are presented. We show that Limited Service Matching achieves better fairness under unbalanced traffic patterns, and in some cases improves the delay performance, while retaining low implementation complexity and a scalable architecture. We prove that EMHW is stable under all admissible traffic. All these schemes can be applied to existing matching algorithms, such as iSLIP and DRRM, to achieve high switching efficiency with low implementation complexities.

AB - Virtual Output Queuing is widely used by fixed-length high-speed switches to overcome head-of-line blocking. This is done by means of matching algorithms. Maximum matching algorithms have good performance, but their implementation complexity is quite high. Maximal matching algorithms need speedup to guarantee good performance. Iterative matching schemes, such as iSLIP and DRRM, use multiple iterations to converge on a maximal match. The objective of matching algorithms is to reduce the matching overhead for each time slot. In this paper, Exhaustive Service Matching is presented as a way to amortize the cost of a match over multiple time slots, thus significantly improving switch performance. In an Exhaustive Service Matching switch, cells belonging to the same packet are transferred to the output continuously, which leads to good packet delay performance and simplifies the implementation of packet reassembly. To avoid unfairness under some extremely unbalanced traffic pattern, Limited Service Matching and Exhaustive Service Matching with Hamiltonian Walk (EMHW) are presented. We show that Limited Service Matching achieves better fairness under unbalanced traffic patterns, and in some cases improves the delay performance, while retaining low implementation complexity and a scalable architecture. We prove that EMHW is stable under all admissible traffic. All these schemes can be applied to existing matching algorithms, such as iSLIP and DRRM, to achieve high switching efficiency with low implementation complexities.

KW - Exhaustive service

KW - Hamiltonian walk

KW - Limited service

KW - Polling

KW - Scheduling

KW - Switching

KW - Virtual Output Queueing

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

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

M3 - Conference contribution

AN - SCOPUS:2942565968

SN - 0780383753

SN - 9780780383753

SP - 253

EP - 258

BT - 2004 Workshop on High Performance Switching and Routing, HPSR 2004

ER -