Content deleted Content added
m avoid unnec redirect |
m rm turd |
||
| (One intermediate revision by one other user not shown) | |||
Line 4:
[[File:ServidorParalelo.jpg|thumb|right|[[#Queueing networks|Queue networks]] 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 [[Queue area|waiting lines]], or [[wikt:queue|queues]].<ref name="sun">{{cite book | title = Probability, Statistics and Queueing Theory | first = V. | last = Sundarapandian | publisher = PHI Learning | year = 2009 | chapter = 7. Queueing Theory | isbn = 978-81-203-3844-9 }}</ref> A queueing model is constructed so that queue lengths and waiting time can be predicted.<ref name="sun" /> 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.<ref name="sun" /> These ideas were seminal to the field of [[teletraffic engineering]] and have since seen applications in [[telecommunications]], [[traffic engineering (transportation)|traffic engineering]], [[computing]],<ref>{{cite web
| |||