On the performance of a Dual Round-Robin switch

Y. Li; S. Panwar; H. Jonathan Chao

On the performance of a Dual Round-Robin switch

Electrical and Computer Engineering

Research output: Contribution to journal › Conference article › peer-review

Abstract

The Dual Round-Robin Matching (DRRM) switch [2] [3] has a scalable, low complexity architecture which allows for an aggregate bandwidth exceeding 1 Tb/s using current CMOS technology. In this paper we prove that the DRRM switch can achieve 100% throughput under i.i.d. and uniform traffic. The DRRM is the first practical matching scheme for which this property has been proved. The performance of the DRRM switch is then studied and compared with the iSLIP switch. The delay performance under uniform traffic and the hot-spot throughput of DRRM is better than that of iSLIP, while the throughput of iSLIP under some non-uniform traffic scenarios is slightly higher than that of DRRM. Since throughput drops below 100% under nonuniform traffic, we also examine some variations of the DRRM matching scheme for nonuniform traffic.

Original language	English (US)
Pages (from-to)	1688-1697
Number of pages	10
Journal	Proceedings - IEEE INFOCOM
Volume	3
State	Published - 2001
Event	20th Annual Joint Conference of the IEEE Computer and Communications Societies - Anchorage, AK, United States Duration: Apr 24 2001 → Apr 26 2001

Keywords

Dual Round Robin
Scheduling
Switching
Virtual output queueing

ASJC Scopus subject areas

General Computer Science
Electrical and Electronic Engineering

Cite this

@article{472a7f57c1e140aeafaa2d8818c096b0,

title = "On the performance of a Dual Round-Robin switch",

abstract = "The Dual Round-Robin Matching (DRRM) switch [2] [3] has a scalable, low complexity architecture which allows for an aggregate bandwidth exceeding 1 Tb/s using current CMOS technology. In this paper we prove that the DRRM switch can achieve 100% throughput under i.i.d. and uniform traffic. The DRRM is the first practical matching scheme for which this property has been proved. The performance of the DRRM switch is then studied and compared with the iSLIP switch. The delay performance under uniform traffic and the hot-spot throughput of DRRM is better than that of iSLIP, while the throughput of iSLIP under some non-uniform traffic scenarios is slightly higher than that of DRRM. Since throughput drops below 100% under nonuniform traffic, we also examine some variations of the DRRM matching scheme for nonuniform traffic.",

keywords = "Dual Round Robin, Scheduling, Switching, Virtual output queueing",

author = "Y. Li and S. Panwar and {Jonathan Chao}, H.",

year = "2001",

language = "English (US)",

volume = "3",

pages = "1688--1697",

journal = "Proceedings - IEEE INFOCOM",

issn = "0743-166X",

publisher = "Institute of Electrical and Electronics Engineers Inc.",

note = "20th Annual Joint Conference of the IEEE Computer and Communications Societies ; Conference date: 24-04-2001 Through 26-04-2001",

}

TY - JOUR

T1 - On the performance of a Dual Round-Robin switch

AU - Li, Y.

AU - Panwar, S.

AU - Jonathan Chao, H.

PY - 2001

Y1 - 2001

N2 - The Dual Round-Robin Matching (DRRM) switch [2] [3] has a scalable, low complexity architecture which allows for an aggregate bandwidth exceeding 1 Tb/s using current CMOS technology. In this paper we prove that the DRRM switch can achieve 100% throughput under i.i.d. and uniform traffic. The DRRM is the first practical matching scheme for which this property has been proved. The performance of the DRRM switch is then studied and compared with the iSLIP switch. The delay performance under uniform traffic and the hot-spot throughput of DRRM is better than that of iSLIP, while the throughput of iSLIP under some non-uniform traffic scenarios is slightly higher than that of DRRM. Since throughput drops below 100% under nonuniform traffic, we also examine some variations of the DRRM matching scheme for nonuniform traffic.

AB - The Dual Round-Robin Matching (DRRM) switch [2] [3] has a scalable, low complexity architecture which allows for an aggregate bandwidth exceeding 1 Tb/s using current CMOS technology. In this paper we prove that the DRRM switch can achieve 100% throughput under i.i.d. and uniform traffic. The DRRM is the first practical matching scheme for which this property has been proved. The performance of the DRRM switch is then studied and compared with the iSLIP switch. The delay performance under uniform traffic and the hot-spot throughput of DRRM is better than that of iSLIP, while the throughput of iSLIP under some non-uniform traffic scenarios is slightly higher than that of DRRM. Since throughput drops below 100% under nonuniform traffic, we also examine some variations of the DRRM matching scheme for nonuniform traffic.

KW - Dual Round Robin

KW - Scheduling

KW - Switching

KW - Virtual output queueing

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

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

M3 - Conference article

AN - SCOPUS:0035009303

SN - 0743-166X

VL - 3

SP - 1688

EP - 1697

JO - Proceedings - IEEE INFOCOM

JF - Proceedings - IEEE INFOCOM

T2 - 20th Annual Joint Conference of the IEEE Computer and Communications Societies

Y2 - 24 April 2001 through 26 April 2001

ER -

On the performance of a Dual Round-Robin switch

Abstract

Keywords

ASJC Scopus subject areas

Other files and links

Fingerprint

Cite this