Providing bandwidth guarantees in an input-buffered crossbar switch

Publisher Website
Google Scholar
Abstract
Introduces and analyzes a method for providing bandwidth reservations in an input-buffered non-blocking crossbar switch. The scheme, which the authors call weighted probabilistic iterative matching (WPIM), is an improvement over probabilistic iterative matching and allows flexible allocation of bandwidth among the switch inputs sharing a common output link in a simple manner. Weighted probabilistic iterative matching allocates the output bandwidth among the inputs based on reservations made during the connection setup phase, and can guarantee that traffic from each input receives its promised share of the bandwidth of the output link. In addition, the algorithm provides isolation between two flows arriving on distinct input links and directed at a common output link; misbehaving flows at one of the inputs do not affect the bandwidth guarantees or delays of traffic from other inputs. Results from simulations show that the scheme is able to maintain probabilistic bandwidth and delay guarantees in the presence of misbehaving traffic. the authors also derive an analytical upper bound for the average delay under the scheme and validate it by simulation.

This publication has 14 references indexed in Scilit: