Modules / Lectures
Module NameDownload

Sl.No Chapter Name English
1Prerequisite: Review of ProbabilityDownload
Verified
2Lec 1: Queueing Systems, System Performance MeasuresDownload
Verified
3Lec 2: Characteristics of Queueing Systems, Kendall's NotationDownload
Verified
4Lec 3: Little's Law, General RelationshipsDownload
Verified
5Lec 4: Laplace and Laplace-Stieltjes Transforms, Probability Generating FunctionsDownload
Verified
6Lec 5: An Overview of Stochastic ProcessesDownload
Verified
7Lec 6: Markov Chains: Definition, Transition ProbabilitiesDownload
Verified
8Lec 7: Classification Properties of Markov ChainsDownload
Verified
9Lec 8: Long-Term Behaviour of Markov ChainsDownload
Verified
10Lec 9: Exponential Distribution and its Properties, Poisson ProcessDownload
Verified
11Lec 10: Poisson Process and its Properties, GeneralizationsDownload
Verified
12Lec 11: Continuous-Time Markov Chains, Generator Matrix, Kolmogorov EquationsDownload
Verified
13Lec 12: Stationary and Limiting Distributions of CTMC, Balance Equations, Birth-Death ProcessesDownload
Verified
14Lec 13: Birth-Death Queues: General Theory, M/M/1 Queues and their Steady State SolutionDownload
Verified
15Lec 14: M/M/1 Queues: Performance Measures, PASTA Property, Waiting Time DistributionsDownload
Verified
16Lec 15: M/M/c Queues, Erlang Delay FormulaDownload
Verified
17Lec 16: M/M/c/K QueuesDownload
Verified
18Lec 17: Erlang's Loss System, Erlang Loss Formula, Infinite-Server QueuesDownload
Verified
19Lec 18: Finite-Source Queues, Engset Loss System, State-Dependent Queues, Queues with ImpatienceDownload
Verified
20Lec 19: Transient Solutions: M/M/1/1, Infinite-Server and M/M/1 Queues, Busy Period AnalysisDownload
Verified
21Lec 20: Queues with Bulk ArrivalsDownload
Verified
22Lec 21: Queues with Bulk ServiceDownload
Verified
23Lec 22: Erlang and Phase-Type DistributionsDownload
Verified
24Lec 23: Erlangian Queues: Erlangian Arrivals, Erlangian Service TimesDownload
Verified
25Lec 24: Nonpreemptive Priority QueuesDownload
Verified
26Lec 25: Nonpreemptive and Preemptive Priority QueuesDownload
Verified
27Lec 26: M/M/1 Retrial QueuesDownload
Verified
28Lec 27: Discrete-Time Queues: Geo/Geo/1 (EAS), Geo/Geo/1 (LAS)Download
Verified
29Lec 28: Introduction to Queueing Networks, Two-Node NetworkDownload
Verified
30Lec 29: Burke's Theorem, General Setup, Tandem NetworksDownload
Verified
31Lec 30: Queueing Networks with Blocking, Open Jackson NetworksDownload
Verified
32Lec 31: Waiting Times and Multiple Classes in Open Jackson NetworksDownload
Verified
33Lec 32: Closed Jackson NetworksDownload
Verified
34Lec 33: Closed Jackson Networks, Convolution AlgorithmDownload
Verified
35Lec 34: Mean-Value Analysis AlgorithmDownload
Verified
36Lec 35: Cyclic Queueing Networks, Extensions of Jackson NetworksDownload
Verified
37Lec 36: Renewal ProcessesDownload
Verified
38Lec 37: Regenerative Processes, Semi-Markov ProcessesDownload
Verified
39Lec 38: M/G/1 Queues, The Pollaczek-Khinchin Mean FormulaDownload
Verified
40Lec 39: M/G/1 Queues, The Pollaczek-Khinchin Transform FormulaDownload
Verified
41Lec 40: M/G/1 Queues: Waiting Times and Busy PeriodDownload
Verified
42Lec 41: M/G/1/K Queues, Additional Insights on M/G/1 QueuesDownload
Verified
43Lec 42: M/G/c, M/G/∞ and M/G/c/c QueuesDownload
Verified
44Lec 43: G/M/1 QueuesDownload
Verified
45Lec 44: G/G/1 Queues: Lindley's Integral EquationDownload
Verified
46Lec 45: G/G/1 Queues: BoundsDownload
Verified
47Lec 46: Vacation Queues: Introduction, M/M/1 Queues with VacationsDownload
Verified
48Lec 47: M/G/1 Queues with VacationsDownload
Verified


Sl.No Language Book link
1EnglishNot Available
2BengaliNot Available
3GujaratiNot Available
4HindiNot Available
5KannadaNot Available
6MalayalamNot Available
7MarathiNot Available
8TamilNot Available
9TeluguNot Available