Abstract
This paper presents a unifying algorithmic analysis for a general class of single server queueing systems with a state dependent Markovian input process and a phase-type service time distribution including single server queues with random and quasirandom input.
Using regenerative analysis we develop numerically stable and efficient recursion schemes to compute the state probabilities. The computation of the waiting times is based on the state probabilities.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Bux W, Herzog U (1977) The phase-concept, approximation of measured data and performance analysis. In: Chandy KM, Reiser M (eds) Proceedings of the International Symposium on Computer Performance, Modeling, Measurement and Evaluation. North-Holland, Amsterdam, pp 23–38
Bux W (1979) Single server queues with general interarrival and phase-type service time distributions-computational algorithms. Proceedings of the 9th International Teletraffic Congress, Torremolinos
Cooper RB (1972) Introduction to queueing theory. Mac-Millan, New York
Hordijk A, Tijms HC (1976) A simple proof of the equivalence of the limiting distributions of the continuous-time and the embedded process of the queue size in the M/G/1 queue. Statist Neerlandica 30:97–100
Kampe G, Kühn PJ (1976) Graded delay systems with infinite or finite source traffic and exponential or constant holding time. Proceedings of the 8th International Teletraffic Congress, Melbourne, pp 256–1/10
Kobayashi H (1976) Modeling and analysis: An introduction to system performance and evaluation methodology. Addison-Wesley, Reading
Kühn PJ (1972) On the calculation of waiting times in switching and computer systems. 15th Report on Studies in Congestion Theory, Institute of Switching and Data Technics, University of Stuttgart
Kühn PJ (1976) Tables on delay systems.Institute of Switching and Data Technics, University of Stuttgart
Lavenberg SS (1975) The steady-state queueing time distribution for the M/G/1 finite capacity queue. Manag Sci 25: 501–506
Neuts MF (1977) Algorithms for the waiting time distributions under various queue disciplines in the M/G/1 queue with service time distribution of phase-type. In: Neuts MF (ed) Algorithmic methods in probability theory. North-Holland, Amsterdam
Riordan J (1962) Stochastic service systems. Wiley, New York
Ross SM (1970) Applied probability models with optimization applications. Holden-Day, San Francisco
Schassberger R (1973) Warteschlangen. Springer-Verlag, Berlin Heidelberg New York
Stidham S Jr (1972) Regenerative processes in the theory of queues with applications to the alternating priority queue. Adv Appl Prob 4:542–577
Stidham S JR (1972) A last word onL=λW. Opcr Res 22:417–421
Takács L (1962) An introduction to the theory of queues. Oxford University Press, New York
Takahashi Y, Takami Y (1976) A numerical method for the steady-state probabilities of a GI/G/c queueing system in a general class. J Oper Res Soc Jpn 19:147–157
Tijms HC, Van Hoorn MH, Federgruen A (1979) Approximations for the steady-state probabilities in the M/G/c queue. Research Report 49, 1979 Vrije Universiteit, Amsterdam
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Tijms, H.C., Van Hoorn, M.H. Algorithms for the state probabilities and waiting times in single server queueing systems with random and quasirandom input and phase-type service times. OR Spektrum 2, 145–152 (1981). https://doi.org/10.1007/BF01719856
Received:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/BF01719856