APPROXIMATION OF TANDEM QUEUES VIA ISOMORPHS
- 1 April 1985
- journal article
- Published by Emerald Publishing in Kybernetes
- Vol. 14 (4) , 225-231
- https://doi.org/10.1108/eb005720
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.Keywords
This publication has 12 references indexed in Scilit:
- Departure process in tandem queuesInternational Journal of Systems Science, 1984
- Isomorphic queuesBulletin of the Australian Mathematical Society, 1977
- Simulating Stable Stochastic Systems, I: General Multiserver QueuesJournal of the ACM, 1974
- A Characterization of M/G/1 Queues with Renewal Departure ProcessesManagement Science, 1973
- Some Aspects of Queueing and Storage SystemsPublished by Springer Nature ,1970
- Some Recent Work and Further Problems in the Theory of QueuesTheory of Probability and Its Applications, 1964
- Waiting Times When Queues are in TandemThe Annals of Mathematical Statistics, 1957
- Stochastic Processes Occurring in the Theory of Queues and their Analysis by the Method of the Imbedded Markov ChainThe Annals of Mathematical Statistics, 1953
- On the distribution of queueing timesMathematical Proceedings of the Cambridge Philosophical Society, 1953
- The Kolmogorov-Smirnov Test for Goodness of FitJournal of the American Statistical Association, 1951