Science Fair Project Encyclopedia
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. Occasionally linked to ride theory.
- A code describing the arrival process. The codes used are:
- A similar code representing the service process. The same symbols are used.
- The Number of service channels.
- The Priority order that jobs in the line are served:
- 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.
- 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 word queue comes from the Latin cauda, meaning tail.
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.
- Little's law
- Queueing delay
- Queue area
- Random early detection (RED)
- Erlang unit
- Engset Calculation
- Teletraffic Queuing Theory
The contents of this article is licensed from www.wikipedia.org under the GNU Free Documentation License. Click here to see the transparent copy and copyright details