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

Document Type

Article

Publication Date

11-1-2005

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. © 2005 IEEE.

Identifier

28844469966 (Scopus)

Publication Title

IEEE Transactions on Communications

External Full Text Location

https://doi.org/10.1109/TCOMM.2005.858667

ISSN

00906778

First Page

1945

Last Page

1951

Issue

11

Volume

53

Grant

0423305

Fund Ref

National Science Foundation

This document is currently not available here.

Share

COinS