Issue No. 11 - November (1988 vol. 14)
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/32.9042
<p>A method for obtaining approximate solutions to load-dependent closed queueing networks containing general service-time distributions and first-come-first-served scheduling disciplines is presented. The technique demonstrated is an extension of the well-known method of R. Marie (1979). A formula for the conditional throughputs is derived. After each iteration a check is performed to guarantee that the results obtained are within a tolerance level epsilon . These iterations are repeated whenever invalid results are detected. On the average, the solutions obtained vary by less than 5% from their respective exact and simulation results.</p>
performance evaluation; queueing networks; load-dependent; service-time distributions; scheduling; conditional throughputs; tolerance level; performance evaluation; queueing theory; scheduling
I. Akyildiz and A. Sieber, "Approximate Analysis of Load Dependent General Queueing Networks," in IEEE Transactions on Software Engineering, vol. 14, no. , pp. 1537-1545, 1988.