Queueing theory: Discovery
The story
How the idea was found and came to be accepted
Agner Erlang joined the Copenhagen Telephone Company in 1908 as a scientific collaborator and ran its new laboratory [1]. In 1909 he published The theory of probability and telephone conversations, his first paper on how random calls load a telephone system [1]. In 1917 a paper on automatic exchanges gave a formula for loss and waiting time [1]. The ideas then spread beyond telephones. In 1961 a proof of L = λW showed that a simple law holds under remarkably general conditions [2]. In the same year Leonard Kleinrock proposed a PhD study of data networks and went on to model them with queueing theory, seeing a queue as the natural way to share a line on demand [4]. To make the maths workable he introduced what he called the critical Independence Assumption, under which a message is given a new length each time it reaches a node [4]. In 1969 the ARPANET, a packet-switching network, was born [4][5].
as of 2026-11-12
People
The people behind it, their years and what each contributed
| Name | Years | Contribution |
|---|---|---|
| Agner Krarup Erlang | 1878 to 1929 | Began queueing theory with his 1909 paper and gave a formula for loss and waiting time in 1917 [1] |
| Leonard Kleinrock | born 1934 | Proposed a study of data networks in 1961 and modelled them with queueing theory [4]; born 1934 [5] |
as of 2026-11-12
Milestones
The key moments, year by year
| Year | Event |
|---|---|
| 1908 | Erlang joins the Copenhagen Telephone Company as a scientific collaborator [1] |
| 1909 | Erlang publishes The theory of probability and telephone conversations [1] |
| 1917 | Erlang gives a formula for loss and waiting time in automatic telephone exchanges, an early use of the theory in telephone engineering [1] |
| 1961 | Little's proof of L = λW is published in Operations Research; Kleinrock proposes his study of data networks [2][4] |
| 1969 | The ARPANET, a packet-switching network that Kleinrock's queueing work fed into, begins [4][5] |
as of 2026-11-12
Sources
- Agner Krarup Erlang MacTutor History of Mathematics, University of St Andrews
- Reprint: Little’s Law as Viewed on Its 50th Anniversary Project Production Institute (reprint of John D. C. Little, Operations Research 59(3), 2011), 2011
- Creating a Mathematical Theory of Computer Networks Leonard Kleinrock, Operations Research 50(1), 2002 (copy on his UCLA site), 2002
- Kleinrock, Leonard - INFORMS INFORMS, History of O.R. Excellence (Leonard Kleinrock)