MA41111: Queuing Theory
Jump to navigation
Jump to search
| MA41111 | |||||||||||||||||||||||||||||
|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|
| Course name | Queuing Theory | ||||||||||||||||||||||||||||
| Offered by | Mathematics | ||||||||||||||||||||||||||||
| Credits | 4 | ||||||||||||||||||||||||||||
| L-T-P | 3-1-0 | ||||||||||||||||||||||||||||
| Previous Year Grade Distribution | |||||||||||||||||||||||||||||
| |||||||||||||||||||||||||||||
| Semester | Autumn | ||||||||||||||||||||||||||||
Syllabus
Syllabus mentioned in ERP
Prerequisite: Prob. Theory/ Prob. and Stats.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/Ek/1, Ek/M/1, M/G/1/N, GI/M/1, priority 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.