Sticky states in banyan network queues and their application to analysis
A finite-buffered banyan network analysis technique designed to model networks at high traffic loads is presented. The technique specially models two states of the network queues: queue empty and queue congested (roughly, zero or one slots free). A congested queue tends to stay congested because packets bound for the queue accumulate in the previous stage. The expected duration of this state is computed using a probabilistic model of a switching module feeding the congested queue. A technique for finding a lower arrival rate to an empty queue is also described. The queues themselves are modeled using independent Markov chains with an additional congested state added. The new analysis technique is novel in its modeling the higher arrival rate to a congested queue and a lower arrival rate to an empty queue. Comparison of queue state distributions obtained with the analysis and simulation shows that an important feature of congestion is modeled. © 1997 Academic Press.
Publication Source (Journal or Book title)
Journal of Parallel and Distributed Computing
Koppelman, D. (1997). Sticky states in banyan network queues and their application to analysis. Journal of Parallel and Distributed Computing, 40 (2), 147-161. https://doi.org/10.1006/jpdc.1996.1293