The dual round robin matching switch with exhaustive service

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 algorithms (such as PIM and iSLIP) use multiple iterations to converge on a maximal match. The dual round-robin matching (DRRM) scheme has performance similar to iSLIP and lower implementation complexity. The objective of matching algorithms is to reduce the matching overhead for each time slot. In this paper we present the exhaustive service dual round-robin matching (EDRRM) algorithm, which amortizes the cost of a match over multiple time slots. While EDRRM suffers from a throughput below 100% for small switch sizes, it is conjectured to achieve an asymptotic 100% throughput under uniform traffic. Simulations show that it achieves high throughput under nonuniform traffic. Its delay performance is not sensitive to traffic burstiness, switch size and packet length. In an EDRRM 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.

Original languageEnglish (US)
Title of host publicationHPSR 2002 - Workshop on High Performance Switching and Routing: Merging Optical and IP Technologies, Proceedings
PublisherIEEE Computer Society
Pages58-63
Number of pages6
ISBN (Print)488552184X, 9784885521843
DOIs
StatePublished - 2002
Event2002 Workshop on High Performance Switching and Routing: Merging Optical and IP Technologies, HPSR 2002 - Kobe, Japan
Duration: May 26 2002May 29 2002

Other

Other2002 Workshop on High Performance Switching and Routing: Merging Optical and IP Technologies, HPSR 2002
CountryJapan
CityKobe
Period5/26/025/29/02

Fingerprint

Switches
Throughput
Costs

Keywords

  • Dual Round Robin
  • polling
  • scheduling
  • switching
  • Virtual Output Queueing

ASJC Scopus subject areas

  • Hardware and Architecture
  • Electrical and Electronic Engineering

Cite this

Li, Y., Panwar, S., & Chao, H. J. (2002). The dual round robin matching switch with exhaustive service. In HPSR 2002 - Workshop on High Performance Switching and Routing: Merging Optical and IP Technologies, Proceedings (pp. 58-63). [1024209] IEEE Computer Society. https://doi.org/10.1109/HPSR.2002.1024209

The dual round robin matching switch with exhaustive service. / Li, Yihan; Panwar, Shivendra; Chao, H. Jonathan.

HPSR 2002 - Workshop on High Performance Switching and Routing: Merging Optical and IP Technologies, Proceedings. IEEE Computer Society, 2002. p. 58-63 1024209.

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

Li, Y, Panwar, S & Chao, HJ 2002, The dual round robin matching switch with exhaustive service. in HPSR 2002 - Workshop on High Performance Switching and Routing: Merging Optical and IP Technologies, Proceedings., 1024209, IEEE Computer Society, pp. 58-63, 2002 Workshop on High Performance Switching and Routing: Merging Optical and IP Technologies, HPSR 2002, Kobe, Japan, 5/26/02. https://doi.org/10.1109/HPSR.2002.1024209
Li Y, Panwar S, Chao HJ. The dual round robin matching switch with exhaustive service. In HPSR 2002 - Workshop on High Performance Switching and Routing: Merging Optical and IP Technologies, Proceedings. IEEE Computer Society. 2002. p. 58-63. 1024209 https://doi.org/10.1109/HPSR.2002.1024209
Li, Yihan ; Panwar, Shivendra ; Chao, H. Jonathan. / The dual round robin matching switch with exhaustive service. HPSR 2002 - Workshop on High Performance Switching and Routing: Merging Optical and IP Technologies, Proceedings. IEEE Computer Society, 2002. pp. 58-63
@inproceedings{0594855d3205477389b42ad48934f98f,
title = "The dual round robin matching switch with exhaustive service",
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 algorithms (such as PIM and iSLIP) use multiple iterations to converge on a maximal match. The dual round-robin matching (DRRM) scheme has performance similar to iSLIP and lower implementation complexity. The objective of matching algorithms is to reduce the matching overhead for each time slot. In this paper we present the exhaustive service dual round-robin matching (EDRRM) algorithm, which amortizes the cost of a match over multiple time slots. While EDRRM suffers from a throughput below 100{\%} for small switch sizes, it is conjectured to achieve an asymptotic 100{\%} throughput under uniform traffic. Simulations show that it achieves high throughput under nonuniform traffic. Its delay performance is not sensitive to traffic burstiness, switch size and packet length. In an EDRRM 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.",
keywords = "Dual Round Robin, polling, scheduling, switching, Virtual Output Queueing",
author = "Yihan Li and Shivendra Panwar and Chao, {H. Jonathan}",
year = "2002",
doi = "10.1109/HPSR.2002.1024209",
language = "English (US)",
isbn = "488552184X",
pages = "58--63",
booktitle = "HPSR 2002 - Workshop on High Performance Switching and Routing: Merging Optical and IP Technologies, Proceedings",
publisher = "IEEE Computer Society",

}

TY - GEN

T1 - The dual round robin matching switch with exhaustive service

AU - Li, Yihan

AU - Panwar, Shivendra

AU - Chao, H. Jonathan

PY - 2002

Y1 - 2002

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 algorithms (such as PIM and iSLIP) use multiple iterations to converge on a maximal match. The dual round-robin matching (DRRM) scheme has performance similar to iSLIP and lower implementation complexity. The objective of matching algorithms is to reduce the matching overhead for each time slot. In this paper we present the exhaustive service dual round-robin matching (EDRRM) algorithm, which amortizes the cost of a match over multiple time slots. While EDRRM suffers from a throughput below 100% for small switch sizes, it is conjectured to achieve an asymptotic 100% throughput under uniform traffic. Simulations show that it achieves high throughput under nonuniform traffic. Its delay performance is not sensitive to traffic burstiness, switch size and packet length. In an EDRRM 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.

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 algorithms (such as PIM and iSLIP) use multiple iterations to converge on a maximal match. The dual round-robin matching (DRRM) scheme has performance similar to iSLIP and lower implementation complexity. The objective of matching algorithms is to reduce the matching overhead for each time slot. In this paper we present the exhaustive service dual round-robin matching (EDRRM) algorithm, which amortizes the cost of a match over multiple time slots. While EDRRM suffers from a throughput below 100% for small switch sizes, it is conjectured to achieve an asymptotic 100% throughput under uniform traffic. Simulations show that it achieves high throughput under nonuniform traffic. Its delay performance is not sensitive to traffic burstiness, switch size and packet length. In an EDRRM 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.

KW - Dual Round Robin

KW - polling

KW - scheduling

KW - switching

KW - Virtual Output Queueing

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

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

U2 - 10.1109/HPSR.2002.1024209

DO - 10.1109/HPSR.2002.1024209

M3 - Conference contribution

SN - 488552184X

SN - 9784885521843

SP - 58

EP - 63

BT - HPSR 2002 - Workshop on High Performance Switching and Routing: Merging Optical and IP Technologies, Proceedings

PB - IEEE Computer Society

ER -