Fast arbitration scheme for terabit packet switches

H. Jonathan Chao, Cheuk H. Lam, Xiaolei Guo

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

Abstract

Input-output queued switches have been widely considered as the most feasible solution for large capacity packet switches and IP routers. The challenge is to develop a high speed and cost-effective arbitration scheme to maximize the switch throughput and delay performance for supporting multimedia services with various quality-of-service (QoS) requirements. In this paper, we propose a ping-pong arbitration (PPA) scheme for output contention resolution in input-output queued switches. The basic idea is to divide the inputs into groups and apply arbitration recursively. Our recursive arbiter is hierarchically structured, consisting of multiple small-size arbiters at each layer. The arbitration time of an n-input switch is proportional to log4[n/2] when we group every two inputs or every two input groups at each layer. We present a 256×256 terabit crossbar multicast packet switch using the PPA. The design shows that our scheme can reduce the arbitration time of the 256×256 switch to 11 gates delay, demonstrating the arbitration is no longer the bottleneck limiting the switch capacity.

Original languageEnglish (US)
Title of host publicationConference Record / IEEE Global Telecommunications Conference
PublisherIEEE
Pages1236-1243
Number of pages8
Volume2
StatePublished - 1999
Event1999 IEEE Global Telecommunication Conference - GLOBECOM'99 - Rio de Janeiro, Braz
Duration: Dec 5 1999Dec 9 1999

Other

Other1999 IEEE Global Telecommunication Conference - GLOBECOM'99
CityRio de Janeiro, Braz
Period12/5/9912/9/99

Fingerprint

Switches
multimedia
cost
services
Multimedia services
Routers
Quality of service
Throughput
speed
Costs

ASJC Scopus subject areas

  • Electrical and Electronic Engineering
  • Global and Planetary Change

Cite this

Chao, H. J., Lam, C. H., & Guo, X. (1999). Fast arbitration scheme for terabit packet switches. In Conference Record / IEEE Global Telecommunications Conference (Vol. 2, pp. 1236-1243). IEEE.

Fast arbitration scheme for terabit packet switches. / Chao, H. Jonathan; Lam, Cheuk H.; Guo, Xiaolei.

Conference Record / IEEE Global Telecommunications Conference. Vol. 2 IEEE, 1999. p. 1236-1243.

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

Chao, HJ, Lam, CH & Guo, X 1999, Fast arbitration scheme for terabit packet switches. in Conference Record / IEEE Global Telecommunications Conference. vol. 2, IEEE, pp. 1236-1243, 1999 IEEE Global Telecommunication Conference - GLOBECOM'99, Rio de Janeiro, Braz, 12/5/99.
Chao HJ, Lam CH, Guo X. Fast arbitration scheme for terabit packet switches. In Conference Record / IEEE Global Telecommunications Conference. Vol. 2. IEEE. 1999. p. 1236-1243
Chao, H. Jonathan ; Lam, Cheuk H. ; Guo, Xiaolei. / Fast arbitration scheme for terabit packet switches. Conference Record / IEEE Global Telecommunications Conference. Vol. 2 IEEE, 1999. pp. 1236-1243
@inproceedings{f484d98d691448d3b7be23016f4ce3a1,
title = "Fast arbitration scheme for terabit packet switches",
abstract = "Input-output queued switches have been widely considered as the most feasible solution for large capacity packet switches and IP routers. The challenge is to develop a high speed and cost-effective arbitration scheme to maximize the switch throughput and delay performance for supporting multimedia services with various quality-of-service (QoS) requirements. In this paper, we propose a ping-pong arbitration (PPA) scheme for output contention resolution in input-output queued switches. The basic idea is to divide the inputs into groups and apply arbitration recursively. Our recursive arbiter is hierarchically structured, consisting of multiple small-size arbiters at each layer. The arbitration time of an n-input switch is proportional to log4[n/2] when we group every two inputs or every two input groups at each layer. We present a 256×256 terabit crossbar multicast packet switch using the PPA. The design shows that our scheme can reduce the arbitration time of the 256×256 switch to 11 gates delay, demonstrating the arbitration is no longer the bottleneck limiting the switch capacity.",
author = "Chao, {H. Jonathan} and Lam, {Cheuk H.} and Xiaolei Guo",
year = "1999",
language = "English (US)",
volume = "2",
pages = "1236--1243",
booktitle = "Conference Record / IEEE Global Telecommunications Conference",
publisher = "IEEE",

}

TY - GEN

T1 - Fast arbitration scheme for terabit packet switches

AU - Chao, H. Jonathan

AU - Lam, Cheuk H.

AU - Guo, Xiaolei

PY - 1999

Y1 - 1999

N2 - Input-output queued switches have been widely considered as the most feasible solution for large capacity packet switches and IP routers. The challenge is to develop a high speed and cost-effective arbitration scheme to maximize the switch throughput and delay performance for supporting multimedia services with various quality-of-service (QoS) requirements. In this paper, we propose a ping-pong arbitration (PPA) scheme for output contention resolution in input-output queued switches. The basic idea is to divide the inputs into groups and apply arbitration recursively. Our recursive arbiter is hierarchically structured, consisting of multiple small-size arbiters at each layer. The arbitration time of an n-input switch is proportional to log4[n/2] when we group every two inputs or every two input groups at each layer. We present a 256×256 terabit crossbar multicast packet switch using the PPA. The design shows that our scheme can reduce the arbitration time of the 256×256 switch to 11 gates delay, demonstrating the arbitration is no longer the bottleneck limiting the switch capacity.

AB - Input-output queued switches have been widely considered as the most feasible solution for large capacity packet switches and IP routers. The challenge is to develop a high speed and cost-effective arbitration scheme to maximize the switch throughput and delay performance for supporting multimedia services with various quality-of-service (QoS) requirements. In this paper, we propose a ping-pong arbitration (PPA) scheme for output contention resolution in input-output queued switches. The basic idea is to divide the inputs into groups and apply arbitration recursively. Our recursive arbiter is hierarchically structured, consisting of multiple small-size arbiters at each layer. The arbitration time of an n-input switch is proportional to log4[n/2] when we group every two inputs or every two input groups at each layer. We present a 256×256 terabit crossbar multicast packet switch using the PPA. The design shows that our scheme can reduce the arbitration time of the 256×256 switch to 11 gates delay, demonstrating the arbitration is no longer the bottleneck limiting the switch capacity.

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

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

M3 - Conference contribution

AN - SCOPUS:0033295806

VL - 2

SP - 1236

EP - 1243

BT - Conference Record / IEEE Global Telecommunications Conference

PB - IEEE

ER -