MA8402 Probability and Queueing Theory Syllabus:

MA8402 Probability and Queueing Theory Syllabus โ€“ Anna University Regulation 2017

OBJECTIVES:

  • To provide necessary basic concepts in probability and random processes for applications such as random signals, linear systems in communication engineering.
  • To understand the basic concepts of probability, one and two dimensional random variables and to introduce some standard distributions applicable to engineering which can describe real life phenomenon.
  • To understand the basic concepts of random processes which are widely used in IT fields.
  • To understand the concept of queueing models and apply in engineering.
  • To understand the significance of advanced queueing models.
  • To provide the required mathematical support in real life problems and develop probabilistic models which can be used in several areas of science and engineering.

UNIT I PROBABILITY AND RANDOM VARIABLES

Probability โ€“ Axioms of probability โ€“ Conditional probability โ€“ Bayeโ€˜s theorem โ€“ Discrete and continuous random variables โ€“ Moments โ€“ Moment generating functions โ€“ Binomial, Poisson, Geometric, Uniform, Exponential and Normal distributions.

UNIT II TWO โ€“ DIMENSIONAL RANDOM VARIABLES

Joint distributions โ€“ Marginal and conditional distributions โ€“ Covariance โ€“ Correlation and linear regression โ€“ Transformation of random variables โ€“ Central limit theorem (for independent and identically distributed random variables).

UNIT III RANDOM PROCESSES

Classification โ€“ Stationary process โ€“ Markov process โ€“ Poisson process โ€“ Discrete parameter Markov chain โ€“ Chapman Kolmogorov equations โ€“ Limiting distributions.

UNIT IV QUEUEING MODELS

Markovian queues โ€“ Birth and death processes โ€“ Single and multiple server queueing models โ€“ Littleโ€˜s formula โ€“ Queues with finite waiting rooms โ€“ Queues with impatient customers : Balking and reneging.

UNIT V ADVANCED QUEUEING MODELS

Finite source models โ€“ M/G/1 queue โ€“ Pollaczek Khinchin formula โ€“ M/D/1 and M/EK/1 as special cases โ€“ Series queues โ€“ Open Jackson networks.

TEXT BOOKS:

1. Gross, D., Shortle, J.F, Thompson, J.M and Harris. C.M., โ€•Fundamentals of Queueing Theoryโ€, Wiley Student 4th Edition, 2014.
2. Ibe, O.C., โ€•Fundamentals of Applied Probability and Random Processesโ€, Elsevier, 1st Indian Reprint, 2007.

REFERENCES:

1. Hwei Hsu, โ€œSchaumโ€˜s Outline of Theory and Problems of Probability, Random Variables and Random Processesโ€, Tata McGraw Hill Edition, New Delhi, 2004.
2. Taha, H.A., โ€œOperations Researchโ€, 9th Edition, Pearson India Education Services, Delhi, 2016.
3. Trivedi, K.S., โ€œProbability and Statistics with Reliability, Queueing and Computer Science Applicationsโ€, 2nd Edition, John Wiley and Sons, 2002.
4. Yates, R.D. and Goodman. D. J., โ€œProbability and Stochastic Processesโ€, 2nd Edition, Wiley India Pvt. Ltd., Bangalore, 2012.