Approximate Analysis of a Dynamic Priority Queueing Method for ATM Networks
A scheduling discipline for multiple classes of traffic in an ATM network is discussed and analyzed. The scheduler has the desirable property of providing minimum bandwidth guarantees for each class of traffic. Its simplicity makes it particularly 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 is found to provide a very good estimate for the mean response time of customers in each queue. The applicability of the analysis to a system with multiple queues is also demonstrated.
KeywordsCoupled queues ATM networks scheduling disciplines
- Gelenbe, E. and Mitrani, I. (1980) Analysis and Synthesis of Computer Systems. Academic Press.Google Scholar
- Huang, T.-Y and Wu, J.-L. C. (1993) Performance analysis of a dynamic priority scheduling method in ATM networks. IEE Proceedings-I, 140, 285–290.Google Scholar
- Kleinrock, L. (1976) Queueing systems, Volume II: Computer applications. John Wiley and Sons.Google Scholar
- Lim, Y. and Kobza, J. (1988) Analysis of a delay-dependent priority discipline in a multiclass traffic packet switching node. in Proc. IEEE INFOCOM.Google Scholar