Queueing theory

Queueing theory (sometimes spelled Queuing theory) is the mathematical study of waiting lines (or queues). There are several related processes, arriving at the back of the queue, waiting in the queue (essentially a storage process), and being served by the server at the front of the queue. It is applicable in transport and telecommunication.

A. K. (Agner Krarup) Erlang, a Danish engineer who worked for the Copenhagen Telephone Exchange, published the first paper on queueing theory in 1909.

Kendall introduced the A/B/C type queueing notation in 1953. It has since been extended:

1/2/3/(4/5/6)

1. A code describing the arrival process. The codes used are:

• M stands for ``Markovian, implying exponential distribution for service times or inter-arrival times.
• D stands for ``degenerate distribution, or ``deterministic service times.
• Ek stands for an Erlang distribution with k as the shape parameter.
• G stands for a ``General distribution.

2. A similar code representing the service process. The same symbols are used.

3. The Number of service channels.

4. The Priority order that jobs in the line served:

• First Come First Serve (FCFS) (or First In First Out - FIFO),
• Last Come First Serve (LCFS) (or Last In First Out - LIFO),
• Service In Random Order (SIRO)

5. The maximum size of the system. The maximum number of customers allowed in the system including those in service. When the number is at this maximum, further arrivals are turned away.

6. The size of calling source. The size of the population from which the customers come. This limits the arrival rate. As more jobs queue up there are fewer available to arrive into the system.

The etymology is from the Latin coda, meaning tail.

Note: Queueing theory is directly applicable to intelligent transportation systems, network telecommunications, server queueing, mainframe computer queueing of telecommunications terminals, and advanced telecommunications systems.

---

External link: http://www2.uwindsor.ca/~hlynka/queue.html