The first Erlang century—and the next

  title={The first Erlang century—and the next},
  author={J. F. C. Kingman},
  journal={Queueing Systems},
  • J. Kingman
  • Published 1 December 2009
  • Economics
  • Queueing Systems
The history of queueing theory, particularly over the first sixty years after Erlang’s 1909 paper, is summarised and assessed, with particular reference to the influence of Pollaczek and Kendall. The interactions between the world of telephone traffic and that of applied probability and operational research are a significant factor. The history is followed by speculation about the directions in which the theory might now develop, in response to new problems and new possibilities. It is… 
Towards Network Calculus A Review of Theories for Dealing With Facilities of Increased Danger
  • A. Baybulatov
  • Mathematics
    2018 Eleventh International Conference "Management of large-scale system development" (MLSD
  • 2018
The article presents a historical review, basic ideas and results of conventional queueing theory and its competitor, network calculus, highlighting the advantages of the latter for dealing with facilities of increased danger.
Queueing Theory
Single queueing nodes are usually described using Kendall’s notation in the form A/S/C where A describes the time between arrivals to the queue, S the size of jobs and C the number of servers at the
Queueing: a perennial theory
Given that there are somany diverse research trends in queueing theory, it is reasonable to say that there is no unified theory of queueing, and there probably never will be. Similar to research
On Transitory Queueing
The framework provides the first ever way of analyzing the standard G/GI/1 model when the authors condition on the number of arrivals, and generalizations and extensions of the Glivenko-Cantelli and Donskers Theorem for empirical processes with triangular arrays are provided.
The aim of the paper is to present selected examples of queueing theory applications to problems in the military and defence domain, to mark the 110 anniversary of queueing theory. The intention was
Robust Queueing Theory
This work develops a calculus for analyzing a network of queues based on the following key principles: the departure from a queue, the superposition, and the thinning of arrival processes have the same uncertainty set representation as the original arrival processes.
The 110th anniversary of queueing theory: Its applications in the military
The aim of the paper is to present selected examples of queueing theory applications to problems in the military and defence domain, to mark the 110th anniversary of queueing theory. The intention
M/G/1 Priority Queues
We examine an M/G/1 queue with several queueing disciplines. After reviewing some background material in probability theory, we consider a first-come first-served queue. Next, we examine an absolute
M/G/1 Priority Queues
This work examines an M/G/1 queue with several queueing disciplines and demonstrates how to numerically invert these Laplace-Stieltjes transforms, showing the waiting time distribution of an accumulating priority queue.
Ergodicity of age-dependent inventory control systems
The limiting joint density of the ages of the units in the system is derived by solving partial differential equations, answering the question of the uniqueness of the stationary distributions which was not addressed in the related literature.


On the distribution of queueing times
The hypothetical model that the present treatment is considering is referred to as the single-server queue, and the details of this model are given in a recent paper by Lindley(5).
The theory of queues with a single server
This paper gives a development in the case where there is a single queue and a single server attending to it; the theory of multiple queues or many servers seems to be a problem of considerable difficulty.
On the algebra of queues
The more one studies the vast and ever-growing literature of the theory of queues, the more one is bewildered by the wide variety of mathematical techniques which different authors have used to
The use of Spitzer's identity in the investigation of the busy period and other quantities in the queue GI/G/ 1
As an illustration of the use of his identity [10], Spitzer [11] obtained the Pollaczek-Khintchine formula for the waiting time distribution of the queue M/G/ 1. The present paper develops this
The stability of queues with non-independent interarrival and service times
From Lemma 1 it follows that none of these queues can be properly substable if all the servers are initially unoccupied.
The impact of a heavy-tailed service-time distribution upon the M/GI/s waiting-time distribution
  • W. Whitt
  • Mathematics
    Queueing Syst. Theory Appl.
  • 2000
By exploiting an infinite-server-model lower bound, we show that the tails of the steady-state and transient waiting-time distributions in the M/GI/s queue with unlimited waiting room and the
On queues in which customers are served in random order
The queue M | G | l is considered in the case in which customers are served in random order. A formal solution is obtained for the waiting time distribution in the steady state, and is used to
Stochastic networks : theory and applications
1. Convergence to equilibria for fluid models of FIFO and processor sharing queueing networks 2. Optimal draining of fluid re-entrant lines: some solved examples 3. On the approximation of queueing
The Single Server Queue.
This classic work has a dual aim: to describe relevant mathematical techniques and to analyse the single server queue and its most important variants.
On doubly stochastic Poisson processes
The class of stationary point processes known as ‘doubly stochastic Poisson processes’ was introduced by Cox (2) and has been studied in detail by Bartlett (1). It is not clear just how large this