Queueing theory started with research by Agner Krarup Erlang when he created models to describe the Copenhagen telephone exchange.[1] The ideas have since seen applications includingtelecommunications,[2] traffic engineering, computing[3] and the design of factories, shops, offices and hospitals.[4] Contents [hide] * 1 Overview * 2 History * 3 Application to telephony * 4 Queueing networks * 5 Utilization * 6 Role of Poisson process, exponential distributions * 7 Limitations of queueing theory * 8 See also * 9 References * 10 Further reading * 11 External links |
-------------------------------------------------
[edit]Overview
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. In fact, one of the flagship journals of the profession is named Queueing Systems.
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,[5] public service and engineering. Applications are frequently encountered incustomer service situations as well as transport and telecommunication. Queueing theory is directly applicable to intelligent transportation systems, call centers, PABXs, networks,telecommunications, server queueing, mainframe computer 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