Queueing analysis of buffered switching networks

A method for analyzing the queueing behavior of switching networks constructed from switches that employ shared buffering or parallel bypass input buffering is presented. The queueing models introduced by Y.C. Jenq (1983) and generalized by T. Szymanski and S. Shaikh (1989) are extended to handle these classes of networks. The analysis explicitly models the state of an entire switch and infers information about the distribution of packets associated with particular inputs or outputs when needed. It is shown that the method can be extended to switching systems with input buffering, including systems supporting bypass queueing. Numerical comparisons of the different buffering techniques are included.<
>