Abstract
Classical results of C. D. Crommelin on the c-server queue with constant service times and Poisson input are extended to the case of the versatile Markovian arrival process, introduced by the author.
The purely probabilistic analysis of a related problem in Markov chains leads to an algorithm for the evaluation of the stationary distributions of the queue length and waiting time at an arbitrary epoch.
As an illustration, the algorithmic steps are discussed in detail for the case where the arrivals form a Markov-modulated Poisson process.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Brumelle, S.L., (1971). On the Relation between Customer and Time Averages in Queues, J. Appl. Probab., 8, 508–520.
Burden, R., Faires, J.D. and Reynolds, A., (1978). Numerical Analysis, Prindle, Weber and Schmidt, Boston, MA.
Crommelin, C.D., (1932). Delay Probability Formulae when the Holding Times are Constant, Post Office Electrical Engineer’s Journal, 25, 41–50.
Crommelin, C.D., (1934). Delay Probability Formulae, Post Office Electrical Engineer’s Journal, 26, 266–274.
Heyman, D.P. and Stidham, S. Jr., (1980). The Relation between Customer and Time Averages in Queues, Oper. Res., 28, 983–994.
Hunter, J. J., (May 1980). “Generalized Inverses and their Application to Applied Probability Problems”, Tech. Report VTR-8006, Dept. of Industrial Engineering and Operations Research, Virginia Polytechnic Institute and State University, Blacksburg, VA.
Kemeny, J. and Snell, J.L., (1960). Finite Markov Chains, Van Nostrand Publ. Co., Princeton, NJ.
Kühn, P., (1976). Tables on Delay Systems, Inst, of Switching and Data Techniques, University of Stuttgart, Stuttgart, Germany.
Lucantoni, D.M. and Neuts, M.F., (May 1978). “Numerical Methods for a Class of Markov Chains, arising in the Theory of Queues”, Tech. Report No. 78/10, University of Delaware.
Neuts, M.F., (1974). “The Markov Renewal Branching Process”, Proceedings of a Conference on Mathematical Methods in the Theory of Queues, Kalamazoo, MI, Springer-Verlag, 1–21.
Neuts, M.F., (1976). Moment Formulas for the Markov Renewal Branching Process, Adv. in Appl. Probab., 8, 690–711.
Neuts, M.F., (1977). Some Explicit Formulas for the Steady-State Behavior of the Queue with Semi-Markovian Service Times, Adv. in Appl. Probab., 9 141–157.
Neuts, M.F., (1977). The M/G/l Queue with Several Types of Customers and Change-over Times, Adv. in Appl. Probab., 9, 604–644.
Neuts, M.F., (1978). Renewal Processes of Phase Type, Naval Res. Logist. Quart., 25, 445–454.
Neuts, M.F., (1979). Queues Solvable without Rouche’s Theorem, Oper. Res., 27, 767–781.
Neuts, M.F., (1979). A Versatile Markovian Point Process, J. Appl. Probab., 16, 764–779.
Neuts, M.F., (1981). Matrix-Geometric Solutions in Stochastic Models - An Algorithmic Approach, The Johns Hopkins University Press, Baltimore, MD.
Ramaswami, V., (October 1978). The N/G/∞ Queue, Tech. Report, Dept. of Math., Drexel University, Philadelphia, PA.
Ramaswami, V., (1980). The N/G/l Queue and its Detailed Analysis, Adv. in Appl. Probab., 12, 222–261.
Ramaswami, V. and Neuts, M.F., (1980). Some Explicit Formulas and Computational Methods for Infinite Server Queues with Phase Type Arrivals, J. Appl. Probab., 17, 498–514.
References
Marcel F. Neuts and Yukio Takahashi (1980), “Asymptotic Behavior of the Stationary Distributions in the Gl/PH/c Queue with Heterogeneous Servers,” Tech. Report No. 57B, Applied Mathematics Institute, University of Delaware.
Richard L. Tweedie (1980), “Operator-Geometric Stationary Distributions for Markov Chains, with Application to Queueing Models,” Tech. Report No. 68B, Applied Mathematics Institute, University of Delaware.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1982 Birkhäuser Boston, Inc.
About this chapter
Cite this chapter
Neuts, M.F., Miller, D.R. (1982). The c — Server Queue with Constant Service Times and a Versatile Markovian Arrival Process. In: Disney, R.L., Ott, T.J. (eds) Applied Probability-Computer Science: The Interface Volume 1. Progress in Computer Science, vol 2. Birkhäuser Boston. https://doi.org/10.1007/978-1-4612-5791-2_2
Download citation
DOI: https://doi.org/10.1007/978-1-4612-5791-2_2
Publisher Name: Birkhäuser Boston
Print ISBN: 978-1-4612-5793-6
Online ISBN: 978-1-4612-5791-2
eBook Packages: Springer Book Archive