On the combined input-crosspoint buffered switch with round-robin arbitration

Roberto Rojas-Cessa, Eiji Oki, H. Jonathan Chao

Research output: Contribution to journalArticle

Abstract

Input-buffered switches have been widely considered for implementing feasible packet switches. However, their matching process may not be time-efficient for switches with high-speed ports. Buffered crossbars (BXs) are an alternative to relax timing for packet switches with high-speed ports and to provide high-performance switching. BX switches were originally considered expensive, as the memory amount required in the crosspoints (XPs) is proportional to the square of the number of ports (O(N2)). This limitation is now less stringent with the advances on chip-fabrication techniques, and when considering small crosspoint (XP) buffer sizes. In this paper, we study a combined input-crosspoint buffered packet switch, named CIXB, with virtual output queues (VOQs) at the inputs, and arbitration based on round-robin selection. We show that the CIXB switch achieves 100% throughput under uniform traffic, and high performance under nonuniform traffic, using one-cell XP buffer size and no speedup.

Original languageEnglish (US)
Pages (from-to)1945-1951
Number of pages7
JournalIEEE Transactions on Communications
Volume53
Issue number11
DOIs
StatePublished - Nov 2005

Fingerprint

Switches
Throughput
Data storage equipment
Fabrication

Keywords

  • Buffered crossbar
  • Credit-based flow control
  • Crosspoint-buffered switch
  • Round-robin arbitration
  • Virtual output queue

ASJC Scopus subject areas

  • Electrical and Electronic Engineering
  • Computer Networks and Communications

Cite this

On the combined input-crosspoint buffered switch with round-robin arbitration. / Rojas-Cessa, Roberto; Oki, Eiji; Chao, H. Jonathan.

In: IEEE Transactions on Communications, Vol. 53, No. 11, 11.2005, p. 1945-1951.

Research output: Contribution to journalArticle

@article{88768397de6f4c949775a7330eea590b,
title = "On the combined input-crosspoint buffered switch with round-robin arbitration",
abstract = "Input-buffered switches have been widely considered for implementing feasible packet switches. However, their matching process may not be time-efficient for switches with high-speed ports. Buffered crossbars (BXs) are an alternative to relax timing for packet switches with high-speed ports and to provide high-performance switching. BX switches were originally considered expensive, as the memory amount required in the crosspoints (XPs) is proportional to the square of the number of ports (O(N2)). This limitation is now less stringent with the advances on chip-fabrication techniques, and when considering small crosspoint (XP) buffer sizes. In this paper, we study a combined input-crosspoint buffered packet switch, named CIXB, with virtual output queues (VOQs) at the inputs, and arbitration based on round-robin selection. We show that the CIXB switch achieves 100{\%} throughput under uniform traffic, and high performance under nonuniform traffic, using one-cell XP buffer size and no speedup.",
keywords = "Buffered crossbar, Credit-based flow control, Crosspoint-buffered switch, Round-robin arbitration, Virtual output queue",
author = "Roberto Rojas-Cessa and Eiji Oki and Chao, {H. Jonathan}",
year = "2005",
month = "11",
doi = "10.1109/TCOMM.2005.858667",
language = "English (US)",
volume = "53",
pages = "1945--1951",
journal = "IEEE Transactions on Communications",
issn = "0090-6778",
publisher = "Institute of Electrical and Electronics Engineers Inc.",
number = "11",

}

TY - JOUR

T1 - On the combined input-crosspoint buffered switch with round-robin arbitration

AU - Rojas-Cessa, Roberto

AU - Oki, Eiji

AU - Chao, H. Jonathan

PY - 2005/11

Y1 - 2005/11

N2 - Input-buffered switches have been widely considered for implementing feasible packet switches. However, their matching process may not be time-efficient for switches with high-speed ports. Buffered crossbars (BXs) are an alternative to relax timing for packet switches with high-speed ports and to provide high-performance switching. BX switches were originally considered expensive, as the memory amount required in the crosspoints (XPs) is proportional to the square of the number of ports (O(N2)). This limitation is now less stringent with the advances on chip-fabrication techniques, and when considering small crosspoint (XP) buffer sizes. In this paper, we study a combined input-crosspoint buffered packet switch, named CIXB, with virtual output queues (VOQs) at the inputs, and arbitration based on round-robin selection. We show that the CIXB switch achieves 100% throughput under uniform traffic, and high performance under nonuniform traffic, using one-cell XP buffer size and no speedup.

AB - Input-buffered switches have been widely considered for implementing feasible packet switches. However, their matching process may not be time-efficient for switches with high-speed ports. Buffered crossbars (BXs) are an alternative to relax timing for packet switches with high-speed ports and to provide high-performance switching. BX switches were originally considered expensive, as the memory amount required in the crosspoints (XPs) is proportional to the square of the number of ports (O(N2)). This limitation is now less stringent with the advances on chip-fabrication techniques, and when considering small crosspoint (XP) buffer sizes. In this paper, we study a combined input-crosspoint buffered packet switch, named CIXB, with virtual output queues (VOQs) at the inputs, and arbitration based on round-robin selection. We show that the CIXB switch achieves 100% throughput under uniform traffic, and high performance under nonuniform traffic, using one-cell XP buffer size and no speedup.

KW - Buffered crossbar

KW - Credit-based flow control

KW - Crosspoint-buffered switch

KW - Round-robin arbitration

KW - Virtual output queue

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

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

U2 - 10.1109/TCOMM.2005.858667

DO - 10.1109/TCOMM.2005.858667

M3 - Article

AN - SCOPUS:28844469966

VL - 53

SP - 1945

EP - 1951

JO - IEEE Transactions on Communications

JF - IEEE Transactions on Communications

SN - 0090-6778

IS - 11

ER -