Subject Code: MA7L009 Subject Name:  Queueing Theory in Computer Science L-T-P: 3-1-0 Credit:4
Pre-requisite(s): Probability and Statistics (MA5L004)
Probability and random variable, discrete and continuous univariate and multivariate distributions, moments, law of large numbers and central limit theorem (without proof). Poisson process, birth and death process, infinite and finite queueing models M/M/1, M/M/C, M/G/1, M/M/1/N, M/E/1, E/M/1, M/G/1/N, GI/M/1, and more complex non-Markovianqueueing models, such as GI/G/1 queues, Multiserver Queues: M/M/c, M/G/c, GI/M/c modles, Erlan’sg loss system, Queues with finite populations: M/M/1/N/K, M/G/1/N/K etc. models and Engset formula, Concept bulk queues: M[X]/M/1, M/M[Y]/1, M/M(a,b)/1, M[X]/G/1, GI[X]/M/1, M/G(a,b)/1, GI/M(a,b)/1 etc. queueing models.
Priority queueing models, Vacation queueing models,Network of queues, finite processor sharing models, central server model of multiprogramming, performance evaluation of systems using queueing models. Concepts of bottleneck and system saturation point. Introduction to discrete time queues and its applications.
Text/ Reference Books:
  1. Gross D.  and Harris C. M. Fundamentals of Queueing Theory, Wiley-India
  2. Kleinrock L. Queueing Systems. Volume 1 : Theory, Wiley-Interscience
  3. Kleinrock L. Computer Applications, Volume 2, Queueing Systems, Wiley-Interscience