Compute PB Bounds (C. H. Hsieh and S. Lam, 1987) for single-class, closed networks with K service centers.
INPUTS
number of requests in the system (scalar, N > 0).
D(k)service demand of service center k (D(k) ≥ 0).
S(k)mean service time at center k (S(k) ≥ 0).
V(k)visit ratio to center 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)).
Zexternal delay (think time, Z ≥ 0). Default 0.
OUTPUTS
XlXuLower and upper bounds on the system throughput.
RlRuLower and upper bounds on the system response time.
REFERENCES
This function implements the non-iterative variant described in G. Casale, R. R. Muntz, G. Serazzi, Geometric Bounds: a Non-Iterative Analysis Technique for Closed Queueing Networks, IEEE Transactions on Computers, 57(6):780-794, June 2008.
See also: qncsaba, qbcsbsb, qncsgb.
Package: queueing