Accuracy of the diffusion approximation for some queuing systems

  • Authors:
  • M. Reiser;H. Kobayashi

  • Affiliations:
  • IBM Research Division Laboratory, San Jose, California;IBM Thomas J. Watson Research Center, Yorktown Heights, New York

  • Venue:
  • IBM Journal of Research and Development
  • Year:
  • 1974

Quantified Score

Hi-index 0.00

Visualization

Abstract

This paper presents the resulotsf a rather extensive study of the accuracy of the diffusion approximation technique as applied to queuing models. The motivef or using the diffusion process approximation here is to develope realistic analytical models of computing systems by considering service time distributions of a general form. We first review the theory of the diffusion approximation for a single server and then develop a new and simplified treatment of a queuing network system. The accuracy of this approximation method is then considered for a wide class of distributional forms of service and interarrival times and for various queuing models. The approximate solutions and exact (or simulation) solutions are compared numerically in terms of the means and variances of queue sizes, server utilizations, the asymptotic decrements of the distributions, and the queue size distributions themselves. The accuracy of the diffusion approximation is found to be quite adequate in most cases and is considerably higher than that obtained by an exponential server model that is prevalent in computer system modeling.