A packet switch with bufferless switch cards and partial distribution of VOQ-state information to parallel arbiters

The main problem of bufferless crosspoint switches is the realization of fast arbitration between the input and output ports. Keeping the arbitration simple and fast, a higher throughput can be achieved by using a number of switches in parallel. With increasing port speed the bandwidth needed to report input queue state information to the parallel arbiters poses a second problem. To avoid costly high-speed communication lines or large number of pins on the arbiter, this paper defines three different methods to reduce this bandwidth by informing the arbiters only partially of the states of the input queues. Simulations of these state distribution methods show a similar and under some conditions even better performance than for a reference method in which all arbiters are completely informed.

[1]  Nick McKeown,et al.  Analysis of a packet switch with memories running slower than the line-rate , 2000, Proceedings IEEE INFOCOM 2000. Conference on Computer Communications. Nineteenth Annual Joint Conference of the IEEE Computer and Communications Societies (Cat. No.00CH37064).

[2]  Nick McKeown,et al.  The Tiny Tera: A Packet Switch Core , 1998, IEEE Micro.

[3]  Nick McKeown,et al.  Matching output queueing with a combined input/output-queued switch , 1999, IEEE J. Sel. Areas Commun..

[4]  Rainer Schoenen,et al.  Weighted Arbitration Algorithms with Priorities for Input-Queued Switches with 100% Throughput , 1999 .

[5]  Kai-Yeung Siu,et al.  On scheduling using parallel input-output queued crossbar switches with no speedup , 2001, 2001 IEEE Workshop on High Performance Switching and Routing (IEEE Cat. No.01TH8552).

[6]  Rainer Schoenen An Architecture Supporting Quality-of-Service in Virtual-Output-Queued Switches (IEICE/IEEE Joint Special Issue on Recent Progress in ATM-Technologies) , 2000 .

[7]  Nick McKeown,et al.  A practical scheduling algorithm to achieve 100% throughput in input-queued switches , 1998, Proceedings. IEEE INFOCOM '98, the Conference on Computer Communications. Seventeenth Annual Joint Conference of the IEEE Computer and Communications Societies. Gateway to the 21st Century (Cat. No.98.

[8]  Eiji Oki,et al.  Concurrent round-robin dispatching scheme in a clos-network switch , 2001, ICC 2001. IEEE International Conference on Communications. Conference Record (Cat. No.01CH37240).

[9]  Nick McKeown,et al.  Scheduling algorithms for input-queued cell switches , 1996 .

[10]  Y. Tamir,et al.  High-performance multi-queue buffers for VLSI communications switches , 1988, ISCA '88.