Please enable JavaScript.
Coggle requires JavaScript to display documents.
MSO Week12 - Coggle Diagram
MSO Week12
theorems
for G/G/s/K queue, pi (e) = pi (d)
for any M/G/s/K queue, we have pi = pi(a)
if system capacity = infinity, if K = infinity, then pi (e) = pi(a) given all arrivals become entries under infinite servers
-
-
-
-
-
multi server queues
-
-
-
expected prob of waiting --> meaning servers are all occupied --> prob that you exceed the num of servers in an infinite capacity queue and you can enter but you hvae to wait
-
expected num of customers, L,
and expected waiting times, W for s = 1 and 2
combining queues are usually more efficient (avg waiting time less) but there are some instances where diff queues are better
revision questions
-
-
-
-
in practice, when solving system of linear equations, you can use matrix inverse --> use matlab or your GC
-
