Skip to content
Tutorials Center
My learning

Topics

Queueing Theory Tutorial

Learn Queueing Theory step by step: 38 lessons in 9 chapters with examples, quizzes, diagrams and practice.

Start learning →

of lessons completed

Getting Started

  1. 1 What Is Queueing Theory? Meet queueing theory: the math of waiting lines. See why queues form, why waits explode near full capacity, and simulate your first queue.
  2. 2 The Anatomy of a Queue Learn the parts of a queueing system: arrival process, service times, number of servers, buffer size, population and service discipline.
  3. 3 Kendall Notation: Naming Queue Models Read and write Kendall notation such as M/M/1, M/D/1 and G/G/c. Learn what each letter means and how variability is measured.
  4. 4 Poisson Arrivals Understand the Poisson process: counts per interval, exponential gaps, merging and splitting streams. Check each fact with a quick simulation.
  5. 5 Exponential Service Times Learn why queueing models use exponential service times: the memoryless property, the minimum of exponentials and the race between arrival and departure.

Basics and Little's Law

  1. 6 Performance Measures: L, Lq, W, Wq and Utilization Define the standard queueing measures: number in system and queue, time in system and queue, utilization and throughput. Compute each from a simulated log.
  2. 7 Little's Law: L = ฮปW Learn Little's Law, the most general result in queueing theory: L = ฮปW. See why it holds, check it on a simulation and apply it to real systems.
  3. 8 Utilization and Stability Understand traffic intensity, utilization and why a queue is stable only when rho < 1. Simulate unstable queues and size the number of servers.
  4. 9 Birth-Death Processes Learn birth-death processes, the balance equations and the product-form solution that give the steady state of M/M/1 and M/M/c queues.

M/M/1 Queues

  1. 10 The M/M/1 Queue: Steady State Derive the steady-state distribution of the M/M/1 queue, a geometric distribution, and check it against a numerical solution of the balance equations.
  2. 11 M/M/1 Performance Measures Derive L, Lq, W and Wq for the M/M/1 queue from its steady state, verify them with Little's law and put them in a reusable calculator.
  3. 12 The M/M/1 Waiting-Time Distribution Go beyond averages: the M/M/1 time in system is exponential, and the queueing delay has an atom at zero. Compute tail probabilities and percentiles.
  4. 13 M/M/1 Design Trade-offs: Speed, Cost and Service Levels Use M/M/1 formulas to choose a service rate that balances cost against waiting, and to find the highest arrival rate that still meets a response-time target.
  5. 14 Checking M/M/1 with Simulation Learn how to check queueing formulas with simulation: independent replications, confidence intervals and warm-up deletion, with M/M/1 as the test case.

Multi-Server Queues

  1. 15 The M/M/c Model: Several Servers, One Line Meet the M/M/c queue: c identical servers sharing one line. Derive its steady-state distribution from the birth-death formula and check it numerically.
  2. 16 The Erlang C Formula Learn the Erlang C formula for the probability that an arriving customer must wait in an M/M/c queue, and compute it stably with a recursion.
  3. 17 M/M/c Performance Measures Compute Lq, Wq, W and L for the M/M/c queue from the Erlang C probability, including the tail P(Wq > t), and verify them against a simulation.
  4. 18 One Line or Many? The Power of Pooling Compare c separate M/M/1 lines with one shared M/M/c line and one fast server. See why pooling cuts waiting and what the limits are.
  5. 19 The M/M/โˆž Queue: Infinite Servers Study the M/M/infinity queue where nobody waits. The number in the system is Poisson, which gives a simple way to size capacity for self-service systems.
  6. 20 Staffing a Call Center with Erlang C Choose the number of agents with Erlang C to meet a service level such as 80/20, and learn the square-root staffing rule for large systems.

Finite Capacity and Priorities

  1. 21 The M/M/1/K Queue: A Waiting Room With a Limit Model a single server with a limited waiting room, compute the blocking probability and effective arrival rate, and use Little's Law on the customers who get in.
  2. 22 Erlang B and Loss Systems Learn the M/M/c/c loss model, the Erlang B formula and its stable recurrence, and how to find how many lines or channels you need for a blocking target.
  3. 23 The Machine Repair Problem: Finite Source Queues Model N machines that break down and are fixed by repair crews: the finite-source queue, its state probabilities, throughput, and how many repairers to hire.
  4. 24 Priority Queues: Preemptive and Non-Preemptive Compute waiting times for each class in an M/G/1 priority queue, compare non-preemptive and preemptive-resume rules, and see the conservation law in action.

M/G/1 and Variability

  1. 25 The M/G/1 Queue and the Pollaczek-Khinchine Formula Drop the exponential service assumption: derive the mean waiting time of an M/G/1 queue, see why variability matters, and compute it from E[S] and E[Sยฒ].
  2. 26 Residual Life and the Inspection Paradox Why do you always seem to wait longer than average? Learn the inspection paradox, the residual service time formula E[Sยฒ]/(2E[S]), and how it drives M/G/1 waits.
  3. 27 Phase-Type Service: Erlang and Hyperexponential Build service-time models with less or more variability than exponential: Erlang-k (csยฒ = 1/k) and hyperexponential mixtures, with M/G/1 waiting times.
  4. 28 Kingman's Formula for the G/G/1 Queue When neither arrivals nor service are Poisson, Kingman's formula still gives a good estimate of waiting time: utilization, variability and mean service multiplied.

Networks of Queues

  1. 29 Tandem Queues and Burke's Theorem Chain M/M/1 queues in series and see why each behaves independently: Burke's theorem says the departures of a stable M/M/1 queue are Poisson.
  2. 30 Jackson Networks and the Traffic Equations Solve open networks of M/M/c queues with probabilistic routing: set up the traffic equations, check stability and use the product-form result to compute delays.
  3. 31 Closed Networks and Mean Value Analysis Analyze closed networks with a fixed population: service demands, the bottleneck, and the mean value analysis algorithm for throughput and response time.
  4. 32 Decomposition and Bottlenecks in Non-Product-Form Networks When service is not exponential, product form fails. Use the decomposition approximation with variability propagation to estimate delays in a line of queues.

Simulation and Applications

  1. 33 Simulating an M/M/1 Queue from Scratch Write a queue simulation in a few lines with Lindley's recursion, compare it with theory, and learn about warm-up bias, run length and random seeds.
  2. 34 A Discrete-Event Simulation Engine with Confidence Intervals Build a reusable event-list simulator for M/M/c queues with heapq, compare it with Erlang C, and report results with confidence intervals from replications.
  3. 35 Staffing a Call Center with Erlang C Use Erlang C to compute the probability of waiting, average speed of answer and service level, then find the number of agents that meets a target.

Projects and Practice

  1. 36 Practice Set: Finite Capacity, Variability and Priorities Eight worked problems on M/M/1/K, Erlang B, machine repair, priority queues and the Pollaczek-Khinchine formula, with code that checks your answers.
  2. 37 Practice Set: Networks and Simulation Six problems on tandem lines, Jackson networks, mean value analysis and simulation checks, each with a runnable calculator so you can verify your solution.
  3. 38 Project: A Call Center Staffing Tool Combine Erlang C, a half-hourly demand forecast and a simulation check into a staffing planner, then compare analytic and simulated service levels.