Queuing Problem
Ajaya Mandal (071BCT501)
Problem
• Consider a database system with an average service
time of 450msec. As database requests are initiated
by large number of clients, a random arrival pattern
may be assumed. Thus the arrival process is assumed
to be Poisson. On the average a new database query
arrives every 500msec. Service times are assumed to
be exponentially distributed, the queuing discipline is
assumed to follow a FCFS pattern , Calculate various
parameter of performance evaluation
2
Arrival rate of jobs, λ=1/0.5 sec
Service rate of the server, μ=1/0.45 sec
System utilization factor=ρ=λ/μ=0.45/0.5=0.9
With 90% utilization the database server can be
deemed heavily loaded. This is also reflected in
the average system size and the average answer
times i.e.
L=ρ/(1-ρ)=0.9/0.1=9
W = L/λ = 9/2 = 4.5 sec