1
Multiple class queueing networks Mean Value Analysis
- Open queueing networks
- Closed queueing networks
Multiple class queueing networks Mean Value Analysis - Open queueing - - PowerPoint PPT Presentation
Multiple class queueing networks Mean Value Analysis - Open queueing networks - Closed queueing networks 1 Open queueing network outgoing requests incoming requests DISK CPU CD Closed queueing network (finite number of users) DISK M
1
2
DISK CD
requests incoming requests
CPU DISK CD CPU M clients
(finite number of users)
3
Different kind of requests should be in a system (queueing network) that need different services by the servers, i.e:
disks)
4
K: number of queues i: queue identification r: class identification (from 1 to R) lr: arrival rate for class r request l = (l1, l2 , ..., lR) Vi,r: average number of visits a class r request makes to server i from its generation to its completion (request goes out from the system if open network)
Si,r: average class r request service time at the server i Wi,r: average class r request waiting time in the queue i Ri,r: average class r request response time in the queue i Ri,r = Si,r + Wi,r
6
R’
i,r: average class r request residence time in the queue i from its
creation to its service completion time (request goes out from the system in case of open network) R’
i,r = Vi,r Ri,r
Di,r: request class r service demand to a server in a queue i from its creation to its service completion time (request goes out from the system in case of open network) Di,r = Vi,r Si,r
Input parameters
Equations
. Ui,r (l) = lr Vi,r Si,r = lr Di,r
r=1 Ui,r (l)
i,r (l) = Di,r
i,r (l) = Di,r / (1-
i=1 R’ i,r (l)
r=1 ni,r (l)
9
(example 9.5 ) Class 1 trx: query l1 = 5 requests per second (tps) DCPU = 0,1 sec Service demand at CPU DDISK1 = 0.08 Service demand at disk 1 DDISK2 = 0.07 Service demand at disk 2 Class 1 trx: updating trx l1 = 2 requests per second (tps) DCPU = 0,15 sec Service demand at CPU DDISK1 = 0.20 Service demand at disk 1 DDISK2 = 0.10 Service demand at disk 2
CPU DISK1 DISK2
10
(example )
CPU DISK1 DISK2 Service demand x
Query Updates
0,1 0,15
0,08 0,20
0,07 0,10
11 Utilizations (%) CPU 50 30 Disk1 40 40 Disk 2 35 20 Residence times (sec) CPU 0,50 0.75 Disk1 0,40 1,00 Disk 2 0,016 0,22 Response times (sec) 1,06 1,97
12
DISK TAPE CPU M clients
(finite number of users)
i,r(N)= Di,r[1+ni(N – 1r)]
r=1 R’ i,r(N)
i,r
r=1 ni,r(N)
i,r(N)= Di,r[1+ni(N – 1r)]
i,1(3,4)= Di,r[1+ni(2,4)]
i,2(3,4)= Di,r[1+ni(3,3)]
16
2/Z1 1,0 0,0 2,0 1/Z1 X0,1(1,0) X0,1(2,0) 2/Z1 1,1 0,1 2,1 1/Z1 X0,1(1,1) X0,1(2,1) 2/Z1 1,2 0,2 2,2 1/Z1 X0,1(1,2) X0,1(2,2) X0,2(2,2) X0,2(2,1) 2/Z2 1/Z2