INPUTS

N

number of requests in the system. N must be strictly greater than zero, and less than the overall network capacity: 0 < N < sum(M).

S(k)

average service time on server $k$ (S(k) > 0).

M(k)

capacity of center $k$. The capacity is the maximum number of requests in a service center, including the request in service (M(k) ≥ 1).

P(i,j)

probability that a request which completes service at server $i$ will be transferred to server $j$.

OUTPUTS

U(k)

center $k$ utilization.

R(k)

average response time of service center $k$.

Q(k)

average number of requests in service center $k$ (including the request in service).

X(k)

center $k$ throughput.

REFERENCES

• Ian F. Akyildiz, Mean Value Analysis for Blocking Queueing Networks, IEEE Transactions on Software Engineering, vol. 14, n. 2, april 1988, pp. 418–428. 10.1109/32.4663

See also: qnopen, qnclosed