Académique Documents
Professionnel Documents
Culture Documents
Queuing Theory
Queuing theory is the mathematics of waiting lines. A queue forms whenever existing demand exceeds the existing capacity of service facility. It is extremely useful in predicting and evaluating system performance.
Queuing system
input Customer Server Queue
output
Examples:
System
Reception desk
Customers Server
People Receptionist
Hospital
Airport Road network Grocery Computer
Patients
Airplanes Cars Shoppers Jobs
Nurses
Runway Traffic light Checkout station CPU, disk, CD
enter
exit
In the system
1) Arrival process
3) Queue discipline
If the system is filled to capacity, arriving unit is not allowed to join the queue. Balking A customer does not join the queue. Reneging A customer joins the queue and subsequently decides to leave. Collusion Customers collaborate to reduce the waiting time. Jockeying A customer switching between multiple queues. Cycling A customer returning to the queue after being served.
5) Service facility
Single queue single server
Service facility
Arrivals
Queue
Queue Arrivals
Arrivals
Queues
Service station
Average number of units (customers) in the system (waiting and being served) = / ( - ) Average time a unit spends in the system (waiting time plus service time) = 1/ ( - )
= /
a)
Merging delays
Merging may be defined as absorption of one group of traffic by another.
Oliver & Bisbee postulated that minor stream queue length are function of
major street flow rates. This model assumes that: A gap of at-least T is required to enter the major stream. Only one entry is permitted through one acceptable gap.
Entries occur just after passing of vehicles, that signals beginning of gap of
acceptable size.
Where, qa = minor stream flow, qb = major stream flow, T = minimum acceptable gap
Where,