Queueing Analysis of Buffered Switching Networks

This paper provides a method of analyzing the queueing behavior of switching networks constructed from switches that employ shared buffering or parallel bypass input buffering. It extends that queuing models first introduced by Jenq and later generalized by Szymanski and Shaikh to handle these classes of networks. Our 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. Earlier analyses of networks constructed from switches using input buffering attempt to infer the state of a switch from the states of individual buffers and cannot be directly applied to the networks of interest here. Moreover the assumption of independence among the buffers in a given switch can lead to substantial inaccuracies of independence among the buffers in a given switch can lead to substantial inaccuracies in some cases, as has been observed by Szymanski and Shaikh. Our approach can also be applied to previously studied systems and yields more accurate results