This preview has intentionally blurred sections. Sign up to view the full version.
View Full Document
Unformatted text preview: what is theavergage number of customers E(n) = sum(k*p_k,0,inf.) E(n) = U/1U E(n) = Nbar what is the throughput? its mew when there is a job Sheet1 Page 2 its 0 when there is no job therefore X=U*mew + 0(1U) X=lambda/mew * mew = lambda IE the throughput is the arival rate and it should be because customers are not created or lost all customers are serviced what is the response time? little's law E(n)= X * R (ie avergage # in the system = throughput * response time) therefore R=E(N)/X = mew/(1mew)/lambda = lambda/mew/lambda(1lambda/mew) = 1/(mewlambda) R= 1/(mew  lambda) when U=0 R=time to process request when U=1 R=infinity wait time = Rmew things to think about what happens if you double the proccess speed...
View
Full Document
 Spring '08
 Michel
 lim, #, Queueing theory, 0.02 seconds, steady state assume

Click to edit the document details