Queueing theory

Uses your system voice; voice and rate in settings.

Snapshot

≈ 9 min read

Names in other languages

No names in other languages are held for this entry yet.

Article bodies are English and are not machine-translated. A name in another language is not a translation of the article.

are systems in which single queues are connected by a routing network. In this image, servers are represented by circles, queues by a series of rectangles and the routing network by arrows. In the study of queue networks one typically tries to obtain the equilibrium distribution of the network, although in many applications the study of the transient state is fundamental. Queueing theory is the mathematical study of queues, or waiting lines. A queueing model is constructed so that queue lengths and waiting time can be predicted.

Queueing theory is generally considered a branch of operations research because the results are often used when making business decisions about the resources needed to provide a service. Queueing theory has its origins in research by Agner Krarup Erlang, who created models to describe the system of incoming calls at the Copenhagen Telephone Exchange Company.

These ideas were seminal to the field of teletraffic engineering and have since seen applications in telecommunications, traffic engineering, computing, project management, and particularly industrial engineering, where they are applied in the design of factories, shops, offices, and hospitals.

are systems in which single queues are connected by a routing network. In this image, servers are represented by circles, queues by a series of rectangles and the routing network by arrows. In the study of queue networks one typically tries to obtain the equilibrium distribution of the network, although in many applications the study of the transient state is fundamental. Queueing theory is the mathematical study of queues, or waiting lines. A queueing model is constructed so that queue lengths and waiting time can be predicted.

Queueing theory is generally considered a branch of operations research because the results are often used when making business decisions about the resources needed to provide a service. Queueing theory has its origins in research by Agner Krarup Erlang, who created models to describe the system of incoming calls at the Copenhagen Telephone Exchange Company.

These ideas were seminal to the field of teletraffic engineering and have since seen applications in telecommunications, traffic engineering, computing, project management, and particularly industrial engineering, where they are applied in the design of factories, shops, offices, and hospitals. The system transitions between values of k by births and deaths, which occur at the arrival rates \lambda_i and the departure rates \mu_i for each job i .

For a queue, these rates are generally considered not to vary with the number of jobs in the queue, so a single average rate of arrivals/departures per unit time is assumed.

Under this assumption, this process has an arrival rate of \lambda = \text{avg}(\lambda_1,\lambda_2,\dots,\lambda_k) and a departure rate of \mu = \text{avg}(\mu_1, \mu_2, \dots, \mu_k) . \mu_1 P_1 = \lambda_0 P_0 \lambda_0 P_0 + \mu_2 P_2 = (\lambda_1 + \mu_1) P_1 \lambda_{n-1} P_{n-1} + \mu_{n+1} P_{n+1} = (\lambda_n + \mu_n) P_n The first two equations imply P_1 = \frac{\lambda_0}{\mu_1} P_0 and P_2 = \frac{\lambda_1}{\mu_2} P_1 + \frac{1}{\mu_2} (\mu_1 P_1 - \lambda_0 P_0) = \frac{\lambda_1}{\mu_2} P_1 = \frac{\lambda_1 \lambda_0}{\mu_2 \mu_1} P_0 By mathematical induction, P_n = \frac{\lambda_{n-1} \lambda_{n-2} \cdots \lambda_0}{\mu_n \mu_{n-1} \cdots \mu_1} P_0 = P_0 \prod_{i = 0}^{n-1} \frac{\lambda_i}{\mu_{i+1}} The condition \sum_{n = 0}^{\infty} P_n = P_0 + P_0 \sum_{n=1}^\infty \prod_{i=0}^{n-1} \frac{\lambda_i}{\mu_{i+1}} = 1 leads to P_0 = \frac{1}{1 + \sum_{n=1}^{\infty}\prod_{i=0}^{n-1} \frac{\lambda_i}{\mu_{i+1}} } which, together with the equation for P_n (n\geq1) , fully describes the required steady state probabilities.

Further, let E_n represent the number of times the system enters state n, and L_n represent the number of times the system leaves state n. Then \left\vert E_n - L_n \right\vert \in \{0, 1\} for all n. That is, the number of times the system leaves a state differs by at most 1 from the number of times it enters that state, since it will either return into that state at some time in the future ( E_n = L_n ) or not ( \left\vert E_n - L_n \right\vert = 1 ). When the system arrives at a steady state, the arrival rate should be equal to the departure rate.

Thus the balanced equations \mu P_1 = \lambda P_0 \lambda P_0 + \mu P_2 = (\lambda + \mu) P_1 \lambda P_{n-1} + \mu P_{n+1} = (\lambda + \mu) P_n imply P_n = \frac{\lambda}{\mu} P_{n-1},\ n=1,2,\ldots The fact that P_0 + P_1 + \cdots = 1 leads to the geometric distribution formula P_n = (1 - \rho) \rho^n where \rho = \frac{\lambda}{\mu} . L = \frac{\lambda - \sigma}{\mu} Assuming an exponential distribution for the rates, the waiting time W can be defined as the proportion of arrivals that are served.

This is equal to the exponential survival rate of those who do not drop out over the waiting period, giving: \frac{\mu}{\lambda} = e^{-W{\mu}} The second equation is commonly rewritten as: W = \frac{1}{\mu} \mathrm{ln}\frac{\lambda}{\mu} The two-stage one-box model is common in epidemiology.

History

In 1909, Agner Krarup Erlang, a Danish engineer who worked for the Copenhagen Telephone Exchange, published the first paper on what would now be called queueing theory. He modeled the number of telephone calls arriving at an exchange by a Poisson process and solved the M/D/1 queue in 1917 and M/D/k queueing model in 1920.

In Kendall's notation: M stands for Markov or memoryless, and means arrivals occur according to a Poisson process D stands for deterministic, and means jobs arriving at the queue require a fixed amount of service k describes the number of servers at the queueing node (k = 1, 2, 3, ...) If the node has more jobs than servers, then jobs will queue and wait for service. The M/G/1 queue was solved by Felix Pollaczek in 1930, a solution later recast in probabilistic terms by Aleksandr Khinchin and now known as the Pollaczek–Khinchine formula.

After the 1940s, queueing theory became an area of research interest to mathematicians. In 1953, David George Kendall solved the GI/M/k queue and introduced the modern notation for queues, now known as Kendall's notation. In 1957, Pollaczek studied the GI/G/1 using an integral equation. John Kingman gave a formula for the mean waiting time in a G/G/1 queue, now known as Kingman's formula. Leonard Kleinrock worked on the application of queueing theory to message switching in the early 1960s and packet switching in the early 1970s.

His initial contribution to this field was his doctoral thesis at the Massachusetts Institute of Technology in 1962, published in book form in 19641. His theoretical work published in the early 1970s underpinned the use of packet switching in the ARPANET, a forerunner to the Internet. The matrix geometric method and matrix analytic methods have allowed queues with phase-type distributed inter-arrival and service time distributions to be considered.

Systems with coupled orbits are an important part in queueing theory in the application to wireless networks and signal processing. Modern day application of queueing theory concerns among other things product development where (material) products have a spatiotemporal existence, in the sense that products have a certain volume and a certain duration. Problems such as performance metrics for the M/G/k queue remain an open problem.

Queueing applications

Queueing theory finds widespread application in computer science and information technology. In networking, for instance, queues are integral to routers and switches, where packets queue up for transmission. By applying queueing theory principles, designers can optimize these systems, ensuring responsive performance and efficient resource utilization. Beyond the technological realm, queueing theory is relevant to everyday experiences.

Whether waiting in line at a supermarket or for public transportation, understanding the principles of queueing theory provides valuable insights into optimizing these systems for enhanced user satisfaction. At some point, everyone will be involved in an aspect of queuing. What some may view to be an inconvenience could possibly be the most effective method.

Queueing theory, a discipline rooted in applied mathematics and computer science, is a field dedicated to the study and analysis of queues, or waiting lines, and their implications across a diverse range of applications. This theoretical framework has proven instrumental in understanding and optimizing the efficiency of systems characterized by the presence of queues. The study of queues is essential in contexts such as traffic systems, computer networks, telecommunications, and service operations.

Queueing theory delves into various foundational concepts, with the arrival process and service process being central. The arrival process describes the manner in which entities join the queue over time, often modeled using stochastic processes like Poisson processes. The efficiency of queueing systems is gauged through key performance metrics. These include the average queue length, average wait time, and system throughput.

These metrics provide insights into the system's functionality, guiding decisions aimed at enhancing performance and reducing wait times. Online chap.15, pp. 380–412 Leonard Kleinrock, Information Flow in Large Communication Nets, (MIT, Cambridge, May 31, 1961) Proposal for a Ph.D. Thesis Leonard Kleinrock. Information Flow in Large Communication Nets (RLE Quarterly Progress Report, July 1961) Leonard Kleinrock. Communication Nets: Stochastic Message Flow and Delay (McGraw-Hill, New York, 1964)

Text derived from https://en.wikipedia.org/w/index.php?oldid=1375631761 under CC BY-SA 4.0; modifications have been made.

References

  1. ↩Wikipedia “Queueing theory” revision 1375631761 · retrieved 2026-10-20 publication date (×1) · confidence 0.95 revision URL