Motivated by the need for a simple and high performance switch architecture that scales up
with the speed of fiber optics, we propose a switch architecture with two-stage switching …

Routers built around a single-stage crossbar and a centralized scheduler do not scale, and
(in practice) do not provide the throughput guarantees that network operators need to make …

The main objective of this sequel is to solve the out-of-sequence problem that occurs in the
load balanced Birkhoff–von Neumann switch with one-stage buffering. We do this by adding …

Most high performance routers today use combined input and output queueing (CIOQ). The
CIOQ router is also frequently used as an abstract model for routers: at one extreme is input …

Traditionally, conflict resolution in an input-buffered switch is solved by finding a matching
between inputs and outputs per time slot, which incurs unscalable computation and …

This paper is about load-balancing packets across multiple paths inside a switch, or across
a network. It is motivated by the recent interest in load-balanced switches. Load-balanced …

Four variants of parallel index nested loop algorithms are compared with the parallel hybrid
hash algorithm. The conclusions of experiments both with an analytic model and with an …

Load-balanced switches have received a great deal of attention recently as they are much
more scalable than other existing switch architectures in the literature. However, as there …

A framework for designing feedback-based scheduling algorithms is proposed for elegantly
solving the notorious packet missequencing problem of a load-balanced switch. Unlike …

The load-balanced Birkhoff-von Neumann switching architecture consists of two stages: a
load balancer and a deterministic input-queued crossbar switch. The advantages of this …