16.2.

2004 /ta

Queueing System Formulas

n nq N Nq r w arrival rate service rate (1/ mean interarrival time) (1/ mean service time)

number of jobs in the system (read: queue length) number of jobs waiting to receive service mean queue length (read: in the system) mean number of jobs waiting to receive service response time waiting time R W mean response time mean waiting time

M/M/1 Utilization, traffic intensity Stability condition: < 1 Number of jobs in the system P{ no jobs in the system } P{ n jobs in the system } P{ number of jobs n} mean queue length N variance of the queue length Number of waiting jobs in the queue P{number of waiting jobs is k} = /

p0 = 1 pn = n(1) n E(n) = /(1) Var(n) = /(1)2

P{nq = k} = 12 , k=0 k+1(1), k>0 mean number of waiting jobs ( Nq = N - ) E(nq) = 2/(1) E(r) = ( 1/ ) / (1) = 1 / ( ) Var(r) = E(r)2 F(t) = 1 e () t r.9 = 2.3 E(r) F(t) = 1 e () t E(w) = [(1/) / (1)]

Response time mean response time R variance of the response time P{ response time t } 0.90 fractile of the response time Waiting time P{ waiting time t } mean waiting time W

M/M/m Traffic intensity Stability condition: < 1 Number of jobs in the system P{ no jobs in the system } P{ n jobs in the system } P{ number of jobs m} mean number of jobs N Number of jobs in the queue mean queue length (Nq = N m) Response time mean response time R response time distribution Waiting time mean waiting time (W= Nq /) distribution of the waiting time M/M/1/B Number of buffers: B Stability condition: the system is always stable Number of jobs in the system P{ no jobs in the system } P{ n jobs in the system } p0 = (1-) / (1 - B+1) , 1 1 / (B+1) , =1 n pn = p0 , 1 1 / (B+1) , =1 0, n>B B+1 E(n) = /(1) (+1) /(1 - B+1) E(r) = E(n) / [ (1pB) ] p0 = { 1+ (m)m / [m! (1-)] + pn = [ (m)n/n! ] p0 , n < m [ n mm/m!] p0 , n m pq = (m)m/ [m! (1)] p0 E(n) = m + pq / (1) E(nq) = pq / (1) E(r) = (1/ ) {1 + pq / [m (1)]} see textbooks E(w) = pq / [ m (1) ] see textbooks
m-1

= /(m)

(m)i / i! } -1

mean number of jobs N Response time mean response time M/M/m/B See textbooks

M/G/1, FCFS Service time s Coefficient of variation C2 = Var(s)/E(s)2 Utilization, traffic intensity Stability condition: < 1 Number of jobs in the system P{ no jobs in the system } mean queue length N = E(s)

p0 = 1 E(n) = + 2(1+C2) / [2(1)] E(n) = + 2 E(s2) / [2(1)] E(nq) = 2(1+C2) / [2(1)] W 0 = E(s2) / 2 E(r) = E(s) + E(s) (1+C2) / [2(1)] E(r) = E(s) + E(s2) / [2(1)] E(r) = E(s) + W 0 / (1) E(w) = E(s) (1+C2) / [2(1)] E(w) = W 0 / (1)

Number of waiting jobs mean number of waiting jobs ( Nq = N - ) Mean remaining service time Response time mean response time (R=E(n)/)

Waiting time mean waiting time (W=E(r)-E(s))

M/G/1, nonpreemptive priority scheduling Classes 1,..,K with class 1 having the highest priority Class-specific interarrival rates (i) and service time distributions (E(si), E(si2)) i = j (j = 1,..,i) total utilization caused by the high-priority classes 1 - i Mean remaining service time Mean waiting time for a class i job Mean waiting time Mean response time for a class i job M/G/1, preemptive priority scheduling Class i job: mean remaining service time mean response time W 0,i = jj E(sj2) / 2 , j=1,..,i Ri = E(si) / (1 i-1) + W 0,i / [(1i-1)(1i)] W 0 = jj E(sj2) / 2 , j=1,..,K W i = W 0 /[(1i-1)(1i)] W = j (j/)W j , j=1,..,K Ri = W i + E(si)

M/G/1, processor sharing Number of jobs in the system P{ n jobs in the system } mean queue length N Response time mean response time R R for a job with the service time s (The total means are the same pn = n(1) E(n) = /(1) E(r) = E(s) / (1) Rs = s / (1)

as in M/M/1, whereas the distributions are different.)