Hostname: page-component-586b7cd67f-rdxmf Total loading time: 0 Render date: 2024-11-22T06:24:11.225Z Has data issue: false hasContentIssue false
  • English
  • Français

Isomorphic queues

Published online by Cambridge University Press:  17 April 2009

A. Ghosal
A. Ghosal
Affiliation:
Council of Scientific and Industrial Research, Rafi Marg, New Delhi, India.
Rights & Permissions [Opens in a new window]

Extract

Core share and HTML view are not available for this content. However, as you have access to this content, a full PDF is available via the ‘Save PDF’ action button.

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.

Type
Research Article
Information
Bulletin of the Australian Mathematical Society , Volume 17 , Issue 2 , October 1977 , pp. 275 - 289
Copyright
Copyright © Australian Mathematical Society 1977

References

[1]Finch, P.D., “The output process of the queueing system M/G/l”, J. Roy. Statist. Soc. Ser. B 21 (1959), 375–380.Google Scholar
[2]Ghosal, A., “Queues in series”, J. Roy. Statist. Soc. Ser. B 24 (1962), 359–363.Google Scholar
[3]Ghosal, A., Some aspects of queueing and storage systems (Lecture Notes in Operations Research and Mathematical Systems, 23. Springer-Verlag, Berlin, Heidelberg, New York, 1970).CrossRefGoogle Scholar
[4]Ghosal, A., “Cybernetic queueing systems I”, Cahiers Centre Études Recherche Opér. 13 (1971), 183–202.Google Scholar
[5]Ghosal, A., “Cybernetic modelling of queueing and storage systems”, SCIMA 4 (1975), 5–18.Google Scholar
[6]Ghosal, A., Isomorphic queues and related problems (Working Paper No. G1/76. Graduate Center of Management, Baruch College, City University of New York, New York, 1976).Google Scholar
[7]Kendall, David G., “Stochastic processes occurring in the theory of queues and their analysis by the method of the imbedded Markov chain”, Ann. Math. Statist. 4 (1953), 338–354.CrossRefGoogle Scholar
[8]Kennedy, Douglas P., The continuity of the single server queue (Technical Report, 12. Department of Operations Research, Stanford University, Stanford, California, 1970).Google Scholar
[9]Klír, J., Valach, M., Cybernetic modelling (Illiffe, London, 1965).Google Scholar
[10]Lilliefors, Hubert W., “Some confidence intervals for queues”, Operations Res. 14 (1966), 723–727.CrossRefGoogle Scholar
[11]Massey, Frank J. Jr., “The Kolmogorov-Smirnov test for goodness of fit”, J. Amer. Statist. Assoc. 46 (1951), 68–78.CrossRefGoogle Scholar
[12]Shimshak, Daniel G., “Isomorphs of series queueing systems”, SCIMA 5 (1976), 57–73.Google Scholar
[13]Smith, Walter M., “On the distribution of queueing times”, Proc. Cambridge Philos. Soc. 49 (1953), 449–461.CrossRefGoogle Scholar
[14]Stern, Louis W., “A numerical study of queueing systems with normal inter-arrival process”, SCIMA 4 (1975), 31–38.Google Scholar
[15]Whitt, Ward, “Weak convergence theorems for queues in heavy traffic” (PhD thesis, Cornell University, New York, 1969. See also: Technical Report, 2. Department of Operations Research, Stanford University, Stanford, California, 1968).Google Scholar