Review of Probability, Random variables and Distributions; Generating functions and transforms; Poisson, Markov and semi-Markov processes.

Characteristics of queueing systems; Little’s formula; 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, algorithms to compute the performance metrics.

Advanced topics like queues with vacations, priority queues, queues with modulated arrival process, and discrete time queues; introduction to matrix-geometric methods; applications of the theory to the performance modelling of computer and communication networks.

Simulation techniques for queues and queueing networks.

Texts and References:

• D. Gross and C. Harris, Fundamentals of Queueing Theory, 3rd Edition, Wiley, 1998.
• R.B. Cooper, Introduction to Queueing Theory, 2nd Edition, North-Holland, 1981.
• L. Kleinrock, Queueing Systems, Vol. 1: Theory, Wiley, 1975; Vol. 2: Computer Applications, Wiley, 1976.
• R. Nelson, Probability, Stochastic Processes, and Queueing Theory: The Mathematics of Computer Performance Modelling, Springer, 1995.
• E. Gelenbe and G. Pujolle, Introduction to Queueing Networks, 2nd Edition, Wiley, 1998.
• T.G. Robertazzi, Computer Networks and Systems: Queueing Theory and Performance Evaluation, 3rd Edition, Springer, 2000.