Abstract
In this paper we consider a multi-server queue with a near general arrival process (represented as an arbitrary state-dependent Coxian distribution), a near general state-dependent Coxian service time distribution and a possibly finite queueing room. In addition to the dependence on the current number of customers in the system, the rate of arrivals and the progress of the service may depend on each other. We propose a semi-numerical method based on the use of conditional probabilities to compute the steady-state queue length distribution in such a queueing system. Our approach is conceptually simple, easy to implement and can be applied to both infinite and finite C m /C k /c-like queues. The proposed method uses a simple fixed-point iteration. In the case of infinite queues, it avoids the need for arbitrary truncation through the use of asymptotic conditional probabilities.
This preliminary study examines the computational behavior of the proposed method with a Cox-2 service distribution. Our results indicate that it is robust and performs well even when the number of servers and the coefficient of variation of the service times are relatively high. The number of iterations to attain convergence varies from low tens to several thousand. For example, we are able to solve queues with 1024 servers and the coefficients of variation of the service time and of the time between arrivals set to 4 within 1100 iterations.
Access provided by Autonomous University of Puebla. Download to read the full chapter text
Chapter PDF
Similar content being viewed by others
Keywords
References
Allen, A.O.: Probability, Statistics, and Queueing Theory with Computer Science Applications, 2nd edn. Academic Press, London (1990)
Asmussen, S., Moller, J.R.: Calculation of the Steady State Waiting Time Distribution in GI/PH/c and MAP/PH/c Queues. Queueing Systems 37, 9–29 (2001)
Bertsimas, D.: An Analytic Approach to a General Class of G/G/s Queueing Systems. Operations Research 38(1), 139–155 (1990)
Bondi, A.B., Whitt, W.: The influence of service-time variability in a closed network of queues. Performance Evaluation 6(3), 219–234 (1986)
Brandwajn, A., Wang, H.: A Conditional Probability Approach to M/G/1-like Queues. Performance Evaluation 65(5), 366–381 (2008)
Brandwajn, A.: Equivalence and Decomposition in Queueing Systems - A Unified Approach. Performance Evaluation 5, 175–185 (1985)
Bux, W., Herzog, U.: The Phase Concept: Approximation of Measured Data and Performance Analysis. In: Proceedings of the International Symposium on Computer Performance Modeling, Measurement and Evaluation, Yorktown Heights, NY, pp. 23–38. North-Holland, Amsterdam (1977)
Cohen, J.W.: On the the M/G/2 Queueing Model. Stochastic Processes and Their Applications 12, 231–248 (1982)
Cosmetatos, G.P.: Approximate Explicit Formulae for the Average Queueing Time in the Process (M/D/r) and (D/M/r). INFOR 13, 328–331 (1975)
Cox, D.R., Smith, W.L.: Queues. John Wiley, New York (1961)
De Smit, J.H.A.: The Queue GI/M/s with Customers of Different Types or the Queue GI/Hm/s. Advances in Applied Probability 15(2), 392–419 (1983)
Faddy, M.: Penalised Maximum Likelihood Estimation of the Parameters in a Coxian Phase-Type Distribution. In: Matrix-Analytic Methods: Theory and Application: Proceedings of the Fourth International Conference, Adelaide, Australia, pp. 107–114 (2002)
Heffer, J.C.: Steady State Solution of the M/Ek/c (infinty, FIFO) queueing system. INFOR. 7, 16–30 (1969)
Hokstad, P.: On the Steady-State Solution of the M/G/2 Queue. Advances in Applied Probability 11(1), 240–255 (1979)
Hokstad, P.: The steady-state solution ok the M/K2/m Queue. Advances in Applied Probability 12(3), 799–823 (1980)
Ishikawa, A.: On the equilibrium solution for the Queueing System GI/Ek/m. TRU Mathematics 15, 47–66 (1979)
Latouche, G., Ramaswami, V.: Introduction to Matrix Analytic Methods in Stochastic Modeling, ASA (1999)
Mayhugh, J.O., McCormick, R.E.: Steady State Solution of the Queue M/Ek/r. Management Science, Theory Series 14(11), 692–712 (1968)
McLean, S., Faddy, M., Millard, P.: Using Markov Models to assess the Performance of a Health and Community Care System. In: Proceedings of the 19th IEEE Symposium on Computer-Based Medical Systems, pp. 777–782 (2006)
Neuts, M.F.: Matrix-geometric solutions in stochastic models. An algorithmic approach. Courier Dover Publications (1994)
Ramaswami, V., Lucantoni, D.M.: Stationary waiting time distribution in queues with phase type service and in quasi-birth-and-death-processes. Stochastic Models 1, 125–136 (1985)
Ramaswami, V., Lucantoni, D.M.: Algorithms for the multi-server queue with phase type service. Stochastic Models 1, 393–417 (1985)
Rhee, K.H., Pearce, C.E.M.: On Some Basic Properties of the Inhomogeneous Quasi-Birth-And-Death Process. Comm. Korean Math. Soc. 12(1), 177–191 (1997)
Saaty, T.L.: Elements of Queueing Theory, with Application. The Annals of Mathematical Statistics 34(4), 1610–1612 (1963)
Sasaki, Y., Imai, H., Tsunoyama, M., et al.: Approximation of probability distribution functions by Coxian distribution to evaluate multimedia systems. Systems and Computers in Japan 35(2), 16–24 (2004)
Seelen, L.P., Tijms, H.C., Van Hoorn, M.H.: Tables for Multi-Server Queues. North-Holland, Amsterdam (1984)
Seelen, L.P.: An Algorithm for Ph/Ph/c Queues. European Journal of the Operations Research Society 23, 118–127 (1986)
Shapiro, S.: The M-Server Queue with Poisson Input and Gamma-Distributed Service of Order Two. Operations Research 14(4), 685–694 (1966)
Takahashi, Y., Takami, Y.: A Numerical Method for the Steady-State Probabilities of a GI/G/s Queueing system in a General Class. Journal of the Operations Research Society of Japan 19, 147–157 (1976)
Takahashi, Y.: Asymptotic Exponentiality of the Tail of the Waiting-Time Distribution in a PH/PH/c Queue. Advances in Applied Probability 13(3), 619–630 (1981)
Tijms, H.C., Van Hoorn, M.H., Federgruen, A.: Approximations for the Steady-State Probabilities in the M/G/c Queue. Advances in Applied Probability 13(1), 186–206 (1981)
van Dijk, N.M.: Why queuing never vanishes. European Journal of Operational Research 99(2), 463–476 (1997)
Whitt, W.: The Effect of Variability in the GI/G/s Queue. Journal of Applied Probability 17(4), 1062–1071 (1980)
Wolff, R.W.: The Effect of Service Time Regularity On System Performance. In: Computer Performance, pp. 297–304. North Holland, Amsterdam (1977)
Ye, Q.: On Latouche-Ramaswami’s logarithmic reduction algorithm for quasi-birth-and-death processes. Comm. Stat. & Stochastic Models 18, 449–467 (2002)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2009 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Brandwajn, A., Begin, T. (2009). Preliminary Results on a Simple Approach to G/G/c-Like Queues. In: Al-Begain, K., Fiems, D., Horváth, G. (eds) Analytical and Stochastic Modeling Techniques and Applications. ASMTA 2009. Lecture Notes in Computer Science, vol 5513. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-02205-0_12
Download citation
DOI: https://doi.org/10.1007/978-3-642-02205-0_12
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-02204-3
Online ISBN: 978-3-642-02205-0
eBook Packages: Computer ScienceComputer Science (R0)