1990Unpublished venueOpen access

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

Lester Lipsky, Dilip Tagare, Edward J. Bigos

Open full text 1 citations

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.

Open-access reader

About this research paper

What this paper is about

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.

Why it matters

OpenAlex reports 1 citations for this work. Citation counts describe recorded attention and do not establish research quality.

Key contribution

A contribution statement is not available in the OpenAlex record.

Method / approach

Method details are not available in the OpenAlex metadata.

Main findings

Findings are not separately available in the OpenAlex metadata.

Limitations

Limitations are not available in the OpenAlex metadata.

Applications

Application details are not available in the OpenAlex metadata.

Available 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.

Key concepts: Queueing theory, Computer science, Layered queueing network, IBM, MATLAB, Algebraic number, G-network, Mean value analysis

Related papers

Back to paper searchBrowse research topicsOriginal source
Evaluation of queuing system parameters using linear algebraic queuing theory---an implementation — Research Paper | ScholarLens