Isomorphic queues
- 1 October 1977
- journal article
- research article
- Published by Cambridge University Press (CUP) in Bulletin of the Australian Mathematical Society
- Vol. 17 (2) , 275-289
- https://doi.org/10.1017/s0004972700010479
Abstract
Two systems of queues are said to be isomorphic in the restricted sense if at least one of their output elements, for example waiting time, queue size, idle time, inter-departure time, and so on, has exactly or approximately the same probability distribution function, irrespective of differences in their input elements, for example, inter-arrival time, service time, and so on. This property has been used in deriving approximate solutions to systems which do not have exact solutions. The paper highlights the systems approach in queueing problems and its practical usefulness.Keywords
This publication has 9 references indexed in Scilit:
- Cybernetic Modelling of Queueing & Storage SystemsPublished by Springer Nature ,1977
- Some Aspects of Queueing and Storage SystemsPublished by Springer Nature ,1970
- Letter to the Editor—Some Confidence Intervals for QueuesOperations Research, 1966
- Queues in SeriesJournal of the Royal Statistical Society Series B: Statistical Methodology, 1962
- The Output Process of the Queueing System M/G/1Journal of the Royal Statistical Society Series B: Statistical Methodology, 1959
- 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
- The Kolmogorov-Smirnov Test for Goodness of FitJournal of the American Statistical Association, 1951