Approximate analysis of coupled queueing in ATM networks

We discuss a scheduling discipline for multiclass traffic in asynchronous transfer mode network nodes. The scheduler provides minimum bandwidth guarantees for each class of traffic and is well suited for high-speed implementation, The scheme is a modification of static head-of-line priority queueing, and was originally presented in a slightly different form by Huang and Wu, We begin by considering a system with two queues which is analyzed by decoupling the system into separate M/G/1 queues. The analysis provides a very good estimate for the mean response time of customers in each queue. We also demonstrate the applicability of the analysis to a system with n greater than or equal to 2 queues