Learn · Introduction To Queueing Theory
Lecture 6 of 50Week-02: Discrete-Time Markov Chains
Lec 5: An Overview of Stochastic Processes
Prof. N. Selvaraju · IIT Guwahati
Credits and licence
- From
- Introduction To Queueing Theory, IIT Guwahati (at NPTEL)
- Licence
- CC BY-NC-SA, as NPTEL states it. Non-commercial use only.
- Attribution
- NPTEL states: "Distributed under Creative Commons Attribution-ShareAlike / CC BY - NC - SA", beside a BY-NC-SA badge.
- Who can watch
- Teens profiles and older. How courses are placed
All the lectures
- Prerequisite: Review of Probability
- Lec 1: Queueing Systems, System Performance Measures
- Lec 2: Characteristics of Queueing Systems, Kendall's Notation
- Lec 3: Little's Law, General Relationships
- Lec 4: Laplace and Laplace-Stieltjes Transforms, Probability Generating Functions
- Lec 5: An Overview of Stochastic Processes
- Lec 6: Markov Chains: Definition, Transition Probabilities
- Lec 7: Classification Properties of Markov Chains
- Lec 8: Long-Term Behaviour of Markov Chains
- Lec 9: Exponential Distribution and its Properties, Poisson Process
- Lec 10: Poisson Process and its Properties, Generalizations
- Lec 11: Continuous-Time Markov Chains, Generator Matrix, Kolmogorov Equations
- Lec 12: Stationary and Limiting Distributions of CTMC, Balance Equations, Birth-Death Processes
- Lec 13: Birth-Death Queues: General Theory, M/M/1 Queues and their Steady State Solution
- Lec 14: M/M/1 Queues: Performance Measures, PASTA Property, Waiting Time Distributions
- Lec 15: M/M/c Queues, Erlang Delay Formula
- Lec 16: M/M/c/K Queues
- Lec 17: Erlang's Loss System, Erlang Loss Formula, Infinite-Server Queues
- Lec 18: Finite-Source Queues, Engset Loss System, State-Dependent Queues, Queues with Impatience
- Lec 19: Transient Solutions: M/M/1/1, Infinite-Server and M/M/1 Queues, Busy Period Analysis
- Lec 20: Queues with Bulk Arrivals
- Lec 21: Queues with Bulk Service
- Lec 22: Erlang and Phase-Type Distributions
- Lec 23: Erlangian Queues: Erlangian Arrivals, Erlangian Service Times
- Lec 24: Nonpreemptive Priority Queues
- Lec 25: Nonpreemptive and Preemptive Priority Queues
- Lec 26: M/M/1 Retrial Queues
- Lec 27: Discrete-Time Queues: Geo/Geo/1 (EAS), Geo/Geo/1 (LAS)
- Lec 28: Introduction to Queueing Networks, Two-Node Network
- Lec 29: Burke's Theorem, General Setup, Tandem Networks
- Lec 30: Queueing Networks with Blocking, Open Jackson Networks
- Lec 31: Waiting Times and Multiple Classes in Open Jackson Networks
- Lec 32: Closed Jackson Networks
- Lec 33: Closed Jackson Networks, Convolution Algorithm
- Lec 34: Mean-Value Analysis Algorithm
- Lec 35: Cyclic Queueing Networks, Extensions of Jackson Networks
- Lec 36: Renewal Processes
- Lec 37: Regenerative Processes, Semi-Markov Processes
- Lec 38: M/G/1 Queues, The Pollaczek-Khinchin Mean Formula
- Lec 39: M/G/1 Queues, The Pollaczek-Khinchin Transform Formula
- Lec 40: M/G/1 Queues: Waiting Times and Busy Period
- Lec 41: M/G/1/K Queues, Additional Insights on M/G/1 Queues
- Lec 42: M/G/c, M/G/∞ and M/G/c/c Queues
- Lec 43: G/M/1 Queues
- Lec 44: G/G/1 Queues: Lindley's Integral Equation
- Lec 45: G/G/1 Queues: Bounds
- Lec 46: Vacation Queues: Introduction, M/M/1 Queues with Vacations
- Lec 47: M/G/1 Queues with Vacations
- Live Session 21-02-2022
- Live Session 17-03-2022