Queuing Theory

unit - 9

Introduction


The study of waiting lines is called queuing theory. theory. In general a queue is formed when either units requiring service commonly referred to as customers , wait for the service facility, stand idle & wait for the customer. customer. Some customers wait when the total number of customers requiring service exceeds the number of service facilities. facilities. Some service facilities stand idle when the total number of service facilities exceeds the number of customers requiring service. service.

Input source


The input source is the source from which customer comes & joins the queue. The input source of the customer to the queuing system can be finite or infinite.

Queuing Model

source

Queue

Server 1 Server 2 Server 3 . . . Sever m

Departure from the system

Point of arrival in the system

Arrival characteristics


Size of the arrival population Pattern of arrival at the queuing system Behavior of arrivals.

Size of the arrival population



Population sizes are considered to be either unlimited i.e infinite or limited i.e finite. finite. It is considered to be infinite if the rate at which source generates the customers is not affected by the number of customers in the service system. system. Alternatively source is considered finite if the rate is affected by the number of customers in the system. system.

Pattern Arrival At the system



Customers arrive at service facility according to some known schedule or else they arrive randomly. randomly. In queuing theory the number of arrivals per unit of time can be estimated by probability distribution known as Poisson distribution. distribution. The major feature of this distribution is that number of people arriving at a given time is not at all influenced by the number of previous arrivals. arrivals. Arrival rate is given by symbol lamda

Behavior of the arrival

A customer joining the service , does not get the immediate service , the customer may : 1. stay in the system until served 2. move from one waiting line to another 3. estimate the waiting time & decide whenever to leave.

The first type of customer who stay in the system are called as patient customers. The other two are classified as impatient or reneging customer.

Queuing Length


The length of a line can be either limited or unlimited. In a sales department where the customers orders are received , there is no restriction on the number of orders that can come in so that a queue of any size can form. form. When there is o limit on its size the permissible queue is said to be infinite. infinite. When there is a limit on size of queue it is said to be finite. finite.

Service Mechanism


Once the customer has entered the system for service , the service system has following characteristic: time taken for service service facility service discipline of the system

Service time


Service time may be either constant or random. If service time is constant , it takes the same amount of time to service each customer. The symbol describing the service rate is and the units are in service per unit time.

Service facilities


Number of channels : A single channel phase case is where the arrivals pass through only one station in order to complete the required service. service. E.g. toll booth , theatre ticket window A multiphase channel involves the situations where the units to be served pass through a series of station in a sequence. sequence.

Single channel Single phase Queue Service facility

Single channel Multiple phase Queue Service facility Service facility

Multiple channel Single phase

Service facility Queue Service facility Multiple channel multiple phase Service facility Queue Service facility Service facility Service facility

Service discipline


Queue discipline refers to the rule by which customers in the line are to receive service. Most systems use queue discipline known as the first in , first out rule (FIFO). Most queues operate on the principle of first come first served . Other ways of dealing with view can be last in , first out ( LIFO) Random service Alphabetically organized.

Application of Queuing system

   

Commercial service system Business industrial system Social service system Transportation service system

Operating characteristics of queuing system



Utilization factor for the system Average number of customer in the system Average number of customer in queue Average time each customer spends in the queue Probability that service will be idle. Probability of specific number of customers in the system

Notations & Terminologies

Notation that has been used for summarizing the main characteristics of parallel queue has universal standardized format: (a/b/c ) : (d/e/f) A : arrival distribution B : service time distribution C = number of parallel servers D = service discipline ( FCFS , LIFO , SIRO) E = maximum number of customers allowed in system F = size of calling source

Basic Notations


Arrival rate( ) : The average rate at which customers arrive & join the queue is the arrival rate. Service time ( ): The average time required to service one customer is service time. The units for the service time should be the inverse of the units for arrival rate. Number of customer in the system (LS): these are the average number of customer in the system both waiting & being serviced. serviced. Average waiting time in the system(WQ): It is the average time each customer in the system both waiting & being serviced. serviced. Average waiting time in the queue (WS): It is the average time each customer waits in the queue. queue.

Model : I (M/M/1): (FIFO// (FIFO//



This is a single channel queuing model. The arrival time has a poison distribution & arrival rate is denoted by Arrivals are from infinite population The queue discipline is FCFS ( i.e FIFO) the customers are served on first come first served basis. There is only single service station The mean arrival rate is less than the mean service rate The waiting space available for customers in the queue is infinite.

 

Model II: (M/M/1): (SIRO/ / )



This model is essentially same as model I except that service discipline follows SIRO rule ( service in random order) As the probability of n customer in the system does not depend upon any queue discipline it may be concluded that SIRO rule case is same as MODEL I

MODEL III : (M/M/1): (FCFS/N/



This model is different from model I in respect to the capacity of the system. Here the capacity of the system is limited to N customers only. Therefore difference equations derived in model as long as n<N

Model IV : (M /EK /1) : (FCFS / / )



The queues in which arrivals & or departures may not follow poison distribution are called as non poison distribution. distribution. This model consists of k identical exponential service phases in series each with mean service time of 1/k . A new service does not start until all k phases have been completed. completed. A service station in which customer passes through k phases shall have the service time following Erlang distribution. distribution.

Characteristics of Erland Distribution



The Erlang distribution is useful for defining the service time of a customer who receives k identical repetitions of a particular service. The probability function of Erlang distribution is given by (k )m (k(k- 1)! Where m is the expected number of customers completing service per unit of time In case of constant distribution of customer interaarival times k tend to

Limitation of Single channel Queuing Model



The waiting space may be limited . The arrival rate is dependent . Potential customers are discouraged from being entering the queue if they observe along line at the time they arrive. arrive. Another limitation that arrival process is not stationary The population of customers may be finite .

Multi Channel Queuing Models



In a multiple queuing system two or more server are available to handle the customer who arrive for service. service.

By introducing number of servicing units the length of the queue & the waiting time are reduced. reduced.

Model v: (M/M/S) : (FCFS /



This a multichannel model in which parallel service stations are serving a single queue. All service stations provide same service Customers are served on first come first basis. Arrival rate has poison distribution with mean rate as Service stations have exponential service times with mean 1/ customers entering in queue & served by all service stations

Queueing Model in series



In real life situations where the arriving customer passes through successive number of service channels in order to complete his service are known as queues in series or Queues in Tandem. Tandem. Queues in series with possibility of queuing. queuing. Queues in series without possibility of Queueing