Performance analysis of a 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. The Exhaustive Service Dual Round-Robin Matching (EDRRM) algorithm 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. In this paper we analyze the performance of an EDRRM switch by using an exhaustive service random polling system model. This was used to predict the performance of switches too large to be simulated within a reasonable run time.

Original languageEnglish (US)
Title of host publicationConference Record / IEEE Global Telecommunications Conference
Pages2292-2297
Number of pages6
Volume3
StatePublished - 2002
EventGLOBECOM'02 - IEEE Global Telecommunications Conference - Taipei, Taiwan, Province of China
Duration: Nov 17 2002Nov 21 2002

Other

OtherGLOBECOM'02 - IEEE Global Telecommunications Conference
CountryTaiwan, Province of China
CityTaipei
Period11/17/0211/21/02

Fingerprint

Switches
Throughput
multiple use
analysis
services
cost
simulation
traffic
Costs

Keywords

  • Dual Round Robin
  • Exhaustive service
  • Polling
  • Scheduling
  • Switching
  • Virtual Output Queuemg

ASJC Scopus subject areas

  • Electrical and Electronic Engineering
  • Global and Planetary Change

Cite this

Li, Y., Panwar, S., & Chao, H. J. (2002). Performance analysis of a dual round Robin matching switch with exhaustive service. In Conference Record / IEEE Global Telecommunications Conference (Vol. 3, pp. 2292-2297)

Performance analysis of a dual round Robin matching switch with exhaustive service. / Li, Yihan; Panwar, Shivendra; Chao, H. Jonathan.

Conference Record / IEEE Global Telecommunications Conference. Vol. 3 2002. p. 2292-2297.

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

Li, Y, Panwar, S & Chao, HJ 2002, Performance analysis of a dual round Robin matching switch with exhaustive service. in Conference Record / IEEE Global Telecommunications Conference. vol. 3, pp. 2292-2297, GLOBECOM'02 - IEEE Global Telecommunications Conference, Taipei, Taiwan, Province of China, 11/17/02.
Li Y, Panwar S, Chao HJ. Performance analysis of a dual round Robin matching switch with exhaustive service. In Conference Record / IEEE Global Telecommunications Conference. Vol. 3. 2002. p. 2292-2297
Li, Yihan ; Panwar, Shivendra ; Chao, H. Jonathan. / Performance analysis of a dual round Robin matching switch with exhaustive service. Conference Record / IEEE Global Telecommunications Conference. Vol. 3 2002. pp. 2292-2297
@inproceedings{25d2551072d14be7a121d816b91db7d2,
title = "Performance analysis of a 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. The Exhaustive Service Dual Round-Robin Matching (EDRRM) algorithm 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. In this paper we analyze the performance of an EDRRM switch by using an exhaustive service random polling system model. This was used to predict the performance of switches too large to be simulated within a reasonable run time.",
keywords = "Dual Round Robin, Exhaustive service, Polling, Scheduling, Switching, Virtual Output Queuemg",
author = "Yihan Li and Shivendra Panwar and Chao, {H. Jonathan}",
year = "2002",
language = "English (US)",
volume = "3",
pages = "2292--2297",
booktitle = "Conference Record / IEEE Global Telecommunications Conference",

}

TY - GEN

T1 - Performance analysis of a 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. The Exhaustive Service Dual Round-Robin Matching (EDRRM) algorithm 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. In this paper we analyze the performance of an EDRRM switch by using an exhaustive service random polling system model. This was used to predict the performance of switches too large to be simulated within a reasonable run time.

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. The Exhaustive Service Dual Round-Robin Matching (EDRRM) algorithm 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. In this paper we analyze the performance of an EDRRM switch by using an exhaustive service random polling system model. This was used to predict the performance of switches too large to be simulated within a reasonable run time.

KW - Dual Round Robin

KW - Exhaustive service

KW - Polling

KW - Scheduling

KW - Switching

KW - Virtual Output Queuemg

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

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

M3 - Conference contribution

VL - 3

SP - 2292

EP - 2297

BT - Conference Record / IEEE Global Telecommunications Conference

ER -