Evaluation of queuing system parameters using linear algebraic queuing theory—an implementation

  • Authors:

  • Lester Lipsky;Dilip Tagare;Edward Bigos

  • Affiliations:

  • Department of Computer Science and Engineering, U-155, University of Connecticut, Storrs, CT;Department of Computer Science and Engineering, U-155, University of Connecticut, Storrs, CT;Department of Computer Science and Engineering, U-155, University of Connecticut, Storrs, CT

  • Venue:
  • SIGSMALL '90 Proceedings of the 1990 ACM SIGSMALL/PC symposium on Small systems
  • Year:
  • 1990

Quantified Score

Hi-index 0.00

Visualization

Abstract

It is important to study the varied characteristics of queueing networks, in a self-consistent manner and interactive environment. We report here the development of an efficient and practical software package (QST) for the analysis of a particular class of queueing systems, (those described by two subsystems which interact only through the exchange of customers) which can run on an IBM PS/2 Model 70 or equivalent, or with some restrictions, on 80286-based PC's. The package produces data (or graphs) of various performance (including residual behavior) characteristics for these generalized queueing loops. It also generates such transient properties as “Busy Period”, “Rush Hour”, and “Mean Time to Failure”. The equations, which are transparent to the user, come from the “Linear Algebraic Approach to Queueing Theory”. For now, the package has been developed within the MATLAB environment. We provide some examples of input and output.