 |
This article needs additional citations for verification. Please help improve this article by adding reliable references. Unsourced material may be challenged and removed. (January 2008) |
Queueing theory is the mathematical study of waiting lines (or queues). The theory enables mathematical analysis of several related processes, including arriving at the (back of the) queue, waiting in the queue (essentially a storage process), and being served by the server(s) at the front of the queue. The theory permits the derivation and calculation of several performance measures including the average waiting time in the queue or the system, the expected number waiting or receiving service and the probability of encountering the system in certain states, such as empty, full, having an available server or having to wait a certain time to be served.
Contents |
[edit] Overview
The word queue comes, via French, from the Latin cauda, meaning tail. Most researchers in the field prefer the spelling "queueing" over "queuing",[1] although the latter is somewhat more common in other contexts.
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 service. It is applicable in a wide variety of situations that may be encountered in business, commerce, industry, healthcare,[2] public service and engineering. Applications are frequently encountered in customer service situations as well as transport and telecommunication (note that something called ride theory is sometimes mentioned, but it is uncertain whether it is a valid theory or a hoax). Queueing theory is directly applicable to intelligent transportation systems, call centers, PABXs, networks, telecommunications, server queueing, mainframe computer queueing of telecommunications terminals, advanced telecommunications systems, and traffic flow.
Notation for describing the characteristics of a queueing model was first suggested by David G. Kendall in 1953. Kendall's notation introduced an A/B/C queueing notation that can be found in all standard modern works on queueing theory, for example, Tijms.[3]
The A/B/C notation designates a queueing system having A as interarrival time distribution, B as service time distribution, and C as number of servers. For example, "G/D/1" would indicate a General (may be anything) arrival process, a Deterministic (constant time) service process and a single server. More details on this notation are given in the article about queueing models.
[edit] History
Agner Krarup Erlang, a Danish engineer who worked for the Copenhagen Telephone Exchange, published the first paper on queueing theory in 1909.
David G. Kendall introduced an A/B/C queueing notation in 1953. Important work on queueing theory used in modern packet switching networks was performed in the early 1960s by Leonard Kleinrock.
[edit] Application to telephony
The public switched telephone network (PSTN) is designed to accommodate the offered traffic intensity with only a small loss. The performance of loss systems is quantified by their grade of service, driven by the assumption that if sufficient capacity is not available, the call is refused and lost.[4] Alternatively, overflow systems make use of alternative routes to divert calls via different paths — even these systems have a finite or maximum traffic carrying capacity.[4]
However, the use of queueing in PSTNs allows the systems to queue their customers' requests until free resources become available. This means that if traffic intensity levels exceed available capacity, customers' calls are here no longer lost; they instead wait until they can be served.[5] This method is used in queueing customers for the next available operator.
A queueing discipline determines the manner in which the exchange handles calls from customers.[5] It defines the way they will be served, the order in which they are served, and the way in which resources are divided between the customers.[5][6] Here are details of four queueing disciplines:
- 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.[6]
- 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.[6]
- Processor sharing
- Customers are served equally. Network capacity is shared between customers and they all effectively experience the same delay.[6]
- Priority
- Customers with high priority are served first.[6]
Queueing is handled by control processes within exchanges, which can be modelled using state equations.[5][6] Queueing systems use a particular form of state equations known as Markov chains which model the system in each state.[5] Incoming traffic to these systems is modelled via a Poisson distribution and is subject to Erlang’s queueing theory assumptions viz.[4]
- Pure-chance traffic – Call arrivals and departures are random and independent events.[4]
- Statistical equilibrium – Probabilities within the system do not change.[4]
- Full availability – All incoming traffic can be routed to any other customer within the network.[4]
- Congestion is cleared as soon as servers are free.[4]
Classic queueing theory involves complex calculations to determine call waiting time, service time, server utilisation and many other metrics which are used to measure queueing performance.[5][6]
[edit] Queueing networks
Queues can be chained to form queueing networks where the departures from one queue enter the next queue. Queueing networks can be classified into two categories:
- Closed queueing networks are those in which customers cannot enter or leave the system of queues, but only move between queues
- Open queueing networks are those in which customers can enter and/or leave the system of queues (e.g., an external input and an external final destination)[7]
[edit] Role of Poisson process, exponential distributions
A useful queueing model both (a) represents a real-life system with sufficient accuracy and (b) is analytically tractable. A queueing model based on the Poisson process and its companion exponential probability distribution often meets these two requirements. A Poisson process models random events (such as a customer arrival, a request for action from a web server, or the completion of the actions requested of a web server) as emanating from a memoryless process. That is, the length of the time interval from the current time to the occurrence of the next event does not depend upon the time of occurrence of the last event. In the Poisson probability distribution, the observer records the number of events that occur in a time interval of fixed length. In the (negative) exponential probability distribution, the observer records the length of the time interval between consecutive events. In both, the underlying physical process is memoryless.
Models based on the Poisson process often respond to inputs from the environment in a manner that mimics the response of the system being modeled to those same inputs. The analytically tractable models that result yield both information about the system being modeled and the form of their solution. Even a queueing model based on the Poisson process that does a relatively poor job of mimicking detailed system performance can be useful. The fact that such models often give "worst-case" scenario evaluations appeals to system designers who prefer to include a safety factor in their designs. Also, the form of the solution of models based on the Poisson process often provides insight into the form of the solution to a queueing problem whose detailed behavior is poorly mimicked. As a result, queueing models are frequently modeled as Poisson processes through the use of the exponential distribution.
[edit] Limitations of mathematical approach
Classic queueing theory is often too mathematically restrictive to be able to model all real-world situations exactly. This restriction arises because the underlying assumptions of the theory do not always hold in the real world.
For example; the mathematical models often assume infinite numbers of customers, infinite queue capacity, or no bounds on inter-arrival or service times, when it is quite apparent that these bounds must exist in reality. Often, although the bounds do exist, they can be safely ignored because the differences between the real-world and theory is not statistically significant, as the probability that such boundary situations might occur is remote compared to the expected normal situation. In other cases the theoretical solution may either prove intractable or insufficiently informative to be useful.
Alternative means of analysis have thus been devised in order to provide some insight into problems which do not fall under the mathematical scope of queueing theory, though they are often scenario-specific since they generally consist of computer simulations and/or of analysis of experimental data. See network traffic simulation.
[edit] See also
- Buzen's algorithm
- Erlang unit
- Jackson network
- Little's law
- Markovian arrival processes
- Pollaczek-Khinchine formula -- the mean analysis of an M/G/1 queue
- Queue area
- Queueing delay
- Random early detection
- Renewal theory
- Throughput
[edit] References
- ^ wiktionary:queueing
- ^ Mayhew, Les; Smith, David (December 2006). "Using queuing theory to analyse completion times in accident and emergency departments in the light of the Government 4-hour target". Cass Business School. Retrieved on 2008-05-20.
- ^ Tijms, H.C, Algorithmic Analysis of Queues", Chapter 9 in A First Course in Stochastic Models, Wiley, Chichester, 2003
- ^ a b c d e f g Flood, J.E. Telecommunications Switching, Traffic and Networks, Chapter 4: Telecommunications Traffic, New York: Prentice-Hall, 1998.
- ^ a b c d e f Bose S.J., Chapter 1 - An Introduction to Queueing Systems, Kluwer/Plenum Publishers, 2002.
- ^ a b c d e f g Penttinen A., Chapter 8 – Queueing Systems, Lecture Notes: S-38.145 - Introduction to Teletraffic Theory.
- ^ F. P. Kelly Networks of Queues with Customers of Different Types Journal of Applied Probability, Vol. 12, No. 3 (Sep., 1975), pp. 542-554
[edit] Further reading
- Gross, Donald; Carl M. Harris (1998). Fundamentals of Queueing Theory. Wiley.
- Deitel, Harvey M. (1984) [1982]. An introduction to operating systems (revisited first edition ed.). Addison-Wesley. pp. 673. ISBN 0-201-14502-2. http://portal.acm.org/citation.cfm?id=79046&dl=GUIDE&coll=GUIDE. chap.15, pp.380-412
- Lazowska, Edward D.; John Zahorjan, G. Scott Graham, Kenneth C. Sevcik (1984). Quantitative System Performance: Computer System Analysis Using Queueing Network Models. Prentice-Hall, Inc. http://www.cs.washington.edu/homes/lazowska/qsp/.
- Zukerman, Moshe. Introduction to Queueing Theory and Stochastic Teletraffic Models. http://www.ee.unimelb.edu.au/staff/mzu/classnotes.pdf.
[edit] External links
All text is available under the terms of the GNU Free Documentation License. (See Copyrights for details.)
Wikipedia® is a registered trademark of the Wikimedia Foundation, Inc.
Privacy policy - About Wikipedia - Disclaimers - Fundraising
