Compute Asymptotic Bounds for open, multiclass networks with K service centers and C customer classes.
INPUTS
lambda(c)class c arrival rate to the system (vector of length
C, lambda(c) > 0).
D(c, k)class c service demand at center k (C \times K
matrix, D(c, k) ≥ 0).
S(c, k)mean service time of class c requests at center k
(C \times K matrix, S(c, k) ≥ 0).
V(c, k)mean number of visits of class c requests at center k
(C \times K matrix, V(c, k) ≥ 0).
OUTPUTS
Xl(c)Xu(c)lower and upper bounds of class c throughput.
Xl(c) is always 0 since there can be no lower
bound on the throughput of open networks (vector of length
C).
Rl(c)Ru(c)lower and upper bounds of class c response time.
Ru(c) is always +inf since there can be no
upper bound on the response time of open networks (vector of length
C).
Package: queueing