Abstract.

Heavy traffic theory is an important tool in understanding how to control queueing networks; it shows promise too in understanding the performance of input-queued switches. I will illustrate this by describing the idea of state space collapse and showing how it comes about under the maximum-weight matching algorithm. This can be used to explain why some weight functions give better performance than others, and perhaps to calculate drop probabilities.