QUEUEING THEORY AND APPLICATIONS

Code: MA597 | L-T-P-C: 3-0-0-6

Review of probability, random variables, distributions, generating functions; Poisson, Markov, renewal and semi-Markov processes; Characteristics of queueing systems, Little’s law, Markovian and non-Markovian queueing systems, embedded Markov chain applications to M/G/1, G/M/1 and related queueing systems; Networks of queues, open and closed queueing networks; Queues with vacations, priority queues, queues with modulated arrival process, discrete time queues, introduction to matrix-geometric methods, applications in manufacturing, computer and communication networks.

Texts:

1. D. Gross and C. Harris, Introduction to Queueing Theory, 3rd Edition, Wiley, 1998 (WSE Edition, 2004)
2. L. Kleinrock, Queueing Systems, Vol. 1: Theory, John Wiley, 1975.
3. J. Medhi, Stochastic Models in Queueing Theory, 2nd Edition, Academic Press, 2003 (Elsevier India Edition, 2006).

References:

1. J.A. Buzacott and J.G. Shanthikumar, Stochastic Models of Manufacturing Systems, Prentice Hall, 1992.
2. R. B. Cooper, Introduction to Queueing Theory, 2nd Edition, North-Holland, 1981.
3. L. Kleinrock, Queueing Systems, Vol. 2: Computer Applications, John Wiley, 1976.
4. R. Nelson, Probability, Stochastic Processes, and Queueing Theory: The Mathematics of Computer Performance Modelling, Springer, 1995.
5. E. Gelenbe and G. Pujolle, Introduction to Queueing Networks, 2nd Edition, Wiley, 1998.