Queueing theory is the mathematical study of waiting lines, or queues.^{[1]} In queueing theory a model is constructed so that queue lengths and waiting times can be predicted.^{[1]} 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 when he created models to describe the Copenhagen telephone exchange.^{[1]} The ideas have since seen applications including telecommunications,^{[2]} traffic engineering, computing^{[3]}
and the design of factories, shops, offices and hospitals.^{[4]}^{[5]}
Etymology
The word queue comes, via French, from the Latin cauda, meaning tail. The spelling "queueing" over "queuing" is typically encountered in the academic research field. One of the flagship journals of the research area is named Queueing Systems.
Single queueing nodes
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 node.^{[6]}^{[7]} Many theorems in queue theory can be proved by reducing queues to mathematical systems known as Markov chains, first described by Andrey Markov in his 1906 paper.^{[8]}
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 in 1909.^{[9]}^{[10]}^{[11]} 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.^{[12]} 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,...). If there are more jobs at the node than there are servers then jobs will queue and wait for service.
The M/M/1 queue is a simple model where a single server serves jobs that arrive according to a Poisson process and have exponentially distributed service requirements. In an M/G/1 queue the G stands for general and indicates an arbitrary probability distribution. The M/G/1 model 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.^{[12]} After World War II queueing theory became an area of research interest to mathematicians.^{[12]}^{[13]}
Work on queueing theory used in modern packet switching networks was performed in the early 1960s by Leonard Kleinrock. It was in this period that John Little gave a proof of the formula which now bears his name: Little's law.^{[14]} In 1961 John Kingman gave a formula for the mean waiting time in a G/G/1 queue: Kingman's formula.^{[15]}
The matrix geometric method and matrix analytic methods have allowed queues with phase-type distributed interarrival and service time distributions to be considered.^{[16]}
Problems such as performance metrics for the M/G/k queue remain an open problem.^{[12]}
Service disciplines
Various scheduling policies can be used at queuing nodes:
- First in first out
- This principle states that customers are served one at a time and that the customer that has been waiting the longest is served first.^{[17]}
- Last in first out
- This principle also serves customers one at a time, however the customer with the shortest waiting time will be served first.^{[17]} Also known as a stack.
- Processor sharing
- Service capacity is shared equally between customers.^{[17]}
- Priority
- Customers with high priority are served first.^{[17]} Priority queues can be of two types, non-preemptive (where a job in service cannot be interrupted) and preemptive (where a job in service can be interrupted by a higher priority job). No work is lost in either model.^{[18]}
- Shortest job first
- The next job to be served is the one with the smallest size
- Preemptive shortest job first
- The next job to be served is the one with the original smallest size^{[19]}
- Shortest remaining processing time
- The next job to serve is the one with the smallest remaining processing requirement.^{[20]}
Queueing networks
Networks of queues are systems in which a number of queues are connected by customer routing. When a customer is serviced at one node it can join another node and queue for service, or leave the network. For a network of m the state of the system can be described by an m–dimensional vector (x_{1},x_{2},...,x_{m}) where x_{i} represents the number of customers at each node. The first significant results in this area were Jackson networks,^{[21]}^{[22]} for which an efficient product-form stationary distribution exists and the mean value analysis^{[23]} which allows average metrics such as throughput and sojourn times to be computed.^{[24]}
If the total number of customers in the network remains constant the network is called a closed network and has also been shown to have a product–form stationary distribution in the Gordon–Newell theorem.^{[25]} This result was extended to the BCMP network^{[26]} where a network with very general service time, regimes and customer routing is shown to also exhibit a product-form stationary distribution.
Networks of customers have also been investigated, Kelly networks where customers of different classes experience different priority levels at different service nodes.^{[27]}
Another type of network are G-networks first proposed by Erol Gelenbe in 1993:^{[28]} these networks do not assume exponential time distributions like the classic Jackson Network.
Mean field limits
Mean field models consider the limiting behaviour of the empirical measure (proportion of queues in different states) as the number of queues (m above) goes to infinity. The impact of other queues on any given queue in the network is approximated by a differential equation. The deterministic model converges to the same stationary distribution as the original model.^{[29]}
Fluid limits
Main article: fluid limit
Fluid models are continuous deterministic analogs of queueing networks obtained by taking the limit when the process is scaled in time and space, allowing heterogenous objects. This scaled trajectory converges to a deterministic equation which allows us stability of the system to be proven. It is known that a queueing network can be stable, but have an unstable fluid limit.^{[30]}
Heavy traffic/diffusion approximations
Main article: heavy traffic approximation
In a system with high occupancy rates (utilisation near 1) a heavy traffic approximation can be used to approximate the queueing length process by a reflected Brownian motion,^{[31]} Ornstein–Uhlenbeck process or more general diffusion process.^{[32]} The number of dimensions of the RBM is equal to the number of queueing nodes and the diffusion is restricted to the non-negative orthant.
Software for simulation/analysis
- Java
- Queueing Package for GNU Octave
See also
References
Further reading
External links
- Queueing theory calculator
- Virtamo's Queueing Theory Course
- Myron Hlynka's Queueing Theory Page
- Queueing Theory Basics
- A free online tool to solve some classical queueing systems
Template:Queueing theory
This article was sourced from Creative Commons Attribution-ShareAlike License; additional terms may apply. World Heritage Encyclopedia content is assembled from numerous content providers, Open Access Publishing, and in compliance with The Fair Access to Science and Technology Research Act (FASTR), Wikimedia Foundation, Inc., Public Library of Science, The Encyclopedia of Life, Open Book Publishers (OBP), PubMed, U.S. National Library of Medicine, National Center for Biotechnology Information, U.S. National Library of Medicine, National Institutes of Health (NIH), U.S. Department of Health & Human Services, and USA.gov, which sources content from all federal, state, local, tribal, and territorial government publication portals (.gov, .mil, .edu). Funding for USA.gov and content contributors is made possible from the U.S. Congress, E-Government Act of 2002.
Crowd sourced content that is contributed to World Heritage Encyclopedia is peer reviewed and edited by our editorial staff to ensure quality scholarly research articles.
By using this site, you agree to the Terms of Use and Privacy Policy. World Heritage Encyclopedia™ is a registered trademark of the World Public Library Association, a non-profit organization.