To read this content please select one of the options below:

APPROXIMATION OF TANDEM QUEUES VIA ISOMORPHS

A. GHOSAL (O.R. Unit, CSIR Complex, New Delhi‐110012 (India))
D.G. SHIMSHAK (University of Massachusets, Boston (USA))
S.C. GUJARIA (O.R. Unit, CSIR Complex, New Delhi‐110012 (India))

Kybernetes

ISSN: 0368-492X

Article publication date: 1 April 1985

54

Abstract

It is analytically difficult to derive the probability distribution function of waiting (or delay) time at the second or third queue in series of tandem queues. This paper presents a method by which approximation is done through a quasi‐isomorphic system which resembles the second queue in respect of one output, viz delay time. Through extensive simulation experiments these isomorphs have been derived. The procedure of getting a simple system to represent a part of a complex system is practised in cybernetics; this approach appears to have potentiality in studying intractable problems in communications and industrial management.

Citation

GHOSAL, A., SHIMSHAK, D.G. and GUJARIA, S.C. (1985), "APPROXIMATION OF TANDEM QUEUES VIA ISOMORPHS", Kybernetes, Vol. 14 No. 4, pp. 225-231. https://doi.org/10.1108/eb005720

Publisher

:

MCB UP Ltd

Copyright © 1985, MCB UP Limited

Related articles