Approximate Analysis of Load Dependent General Queueing Networks

  • Authors:
  • I. F. Akyildiz;Albrecht Sieber

  • Affiliations:
  • Louisiana State Univ., Baton Rouge;Louisiana State Univ., Baton Rouge

  • Venue:
  • IEEE Transactions on Software Engineering
  • Year:
  • 1988

Quantified Score

Hi-index 0.00

Visualization

Abstract

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.