The maximum throughput of a nonblocking space-division packet switch with correlated destinations

We propose a discrete-time queueing network model for space-division packet switches, in which the destinations of consecutive packets may be correlated, and different input traffic may have different destination distributions. We show that for switches under saturation, the steady-state probabilities have an approximate product-form solution. The solution is very accurate for real applications where the average packet sizes are often more than 10 times the number of bytes that can be transmitted in one time slot.<
>