Compute Asymptotic Bounds for open, single-class networks with K service centers.
INPUTS
lambda
Arrival rate of requests (scalar, lambda ≥ 0
).
D(k)
service demand at center k.
(vector of length K, D(k) ≥ 0
).
S(k)
mean service time at center k.
(vector of length K, S(k) ≥ 0
).
V(k)
mean number of visits to center k.
(vector of length K, V(k) ≥ 0
).
m(k)
number of servers at center k.
This function only supports M/M/1 queues, therefore
m must be ones(size(S))
.
OUTPUTS
Xl
Xu
Lower and upper bounds on the system throughput. Xl is always set to 0 since there can be no lower bound on the throughput of open networks (scalar).
Rl
Ru
Lower and upper bounds on the system response time. Ru
is always set to +inf
since there can be no upper bound on the
throughput of open networks (scalar).
See also: qnomaba.
Package: queueing