# Queueing theory: The idea

Source page: https://www.materialinsights.org/science/queueing_theory/sci-idea/

#### In plain words

The idea explained without jargon

Waiting lines form wherever demand arrives at random and service takes time: calls at an exchange, packets at a router, cars at a light. Queueing theory works out how long the line will be and how long customers wait, from two things: how fast demand arrives and how fast it is served. The main lesson is that waiting does not grow in step with the load. In the simplest queue the average number in the system is utilisation divided by one minus utilisation, so it climbs steeply as the server nears full use (worked out from the formula in ^[3]). Little's law links the quantities simply: the average number in the system equals the average arrival rate times the average time spent in it ^[2]. Erlang began the subject at a telephone company ^[1].

as of 2026-11-12

#### Key equation

The equation that sums it up, and what each symbol means

**Equation**
: L = lambda * W

**Symbols**
: {"L":"the average number of items in the system, waiting and being served","lambda":"the average rate at which items arrive, for example calls per minute","W":"the average time an item spends in the system, from arrival to leaving"}

**Note**
: This is Little's law, proved in 1961, which holds under remarkably general conditions and for any order of service ^[2]. For the simplest queue with random arrivals, W = 1 / (mu - lambda), where mu is the service rate ^[3].

as of 2026-11-12

#### An analogy

A picture from everyday life that makes the idea easier to hold

Think of a supermarket checkout. Customers turn up at random and each takes a different time, so even when the till is free on average, bunching makes lines form. As the till gets busier, a small rise in customers makes the line much longer. The picture stops being true for real shoppers who switch lanes, give up and leave, or are served in a set order, which theory has to model separately.

as of 2026-11-12

#### Sources

1. [Agner Krarup Erlang](https://mathshistory.st-andrews.ac.uk/Biographies/Erlang/) MacTutor History of Mathematics, University of St Andrews
2. [Reprint: Little’s Law as Viewed on Its 50th Anniversary](https://projectproduction.org/journal/reprint-littles-law-as-viewed-on-its-50th-anniversary/) Project Production Institute (reprint of John D. C. Little, Operations Research 59(3), 2011), 2011
3. [M/M/1 Queue](https://ocw.mit.edu/courses/2-854-introduction-to-manufacturing-systems-fall-2016/927056a1af54772a587fd84ad4951e71_MIT2_854F16_Mm1Queue.pdf) MIT OpenCourseWare, 2.854 Introduction To Manufacturing Systems (Fall 2016), 2016

## Other sections

- [Summary](https://www.materialinsights.org/science/queueing_theory/index.md)
- [Discovery](https://www.materialinsights.org/science/queueing_theory/sci-discovery/index.md)
- [Technologies](https://www.materialinsights.org/science/queueing_theory/sci-technologies/index.md)
