A linear algebraic approach to queueing theory

Author

Lipsky, Lester R. ; Van de Liefvoort, Appie

Author_Institution

Dept. of Comput. Sci. & Eng., Connecticut Univ., Storrs, CT, USA

fYear

1991

fDate

3-5 Apr 1991

Firstpage

200

Lastpage

202

Abstract

A survey of the basic formulas of queueing theory is presented, indicating their limitations in dealing with non-exponential service time distributions and non-steady-state behavior. The authors then describe a linear algebraic formulation which is a complete procedure for dealing with non-exponential servers. The formulation is invariant to a class of similarity transformations and thus does not depend on the phases used to describe the servers. The authors show how to treat M/G/1, G/M/1 and G/G/1 queues using this formalism. Finally, they show how transient properties of queueing systems can be calculated, using the same mathematical objects which were used for analyzing their steady-state properties

Keywords

linear algebra; queueing theory; G/G/1 queues; G/M/1; M/G/1; linear algebraic approach; linear algebraic formulation; mathematical objects; non-exponential servers; non-exponential service time distributions; non-steady-state behavior; queueing systems; queueing theory; similarity transformations; steady-state properties; transient properties; Cities and towns; Computer science; Distributed computing; Numerical stability; Queueing analysis; Steady-state; Time measurement; Transient analysis;

fLanguage

English

Publisher

ieee

Conference_Titel

Applied Computing, 1991., [Proceedings of the 1991] Symposium on

Conference_Location

Kansas City, MO

Print_ISBN

0-8186-2136-2

Type

conf

DOI

10.1109/SOAC.1991.143876

Filename

143876