Cybernetics and Systems Analysis

, Volume 54, Issue 2, pp 271–277 | Cite as

Recurrence Relations for Multichannel Queueing Systems with Second-Order Erlangian Service Times

Article
  • 10 Downloads

Abstract

We propose a method to analyze queueing systems M / E2 / n / m, M / E2 / n / ∞, including the case of random dropping of customers. Recurrence relations are obtained to compute the steady-state distribution of the number of customers in the system and steady-state characteristics. The developed algorithms are tested on examples using simulation models constructed with the use of the GPSS World tools.

Keywords

multichannel queueing systems Erlangian service times random dropping of customers fictitious phase method recurrence relations steady-state characteristics 

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    E. Brockmeyer, H. L. Halstrøîm, and A. Jensen, The Life and Works of A. K. Erlang, Danish Academy of Technical Sciences, Copenhagen (1948).MATHGoogle Scholar
  2. 2.
    M. F. Neuts, Matrix-Geometric Solutions in Stochastic Models, The Johns Hopkins University Press, Baltimore (1981).MATHGoogle Scholar
  3. 3.
    P. P. Bocharov, A. V. Pechinkin, Queuing Theory [in Russian], RUDN, Moscow (1995).Google Scholar
  4. 4.
    P. P. Bocharov, V. G. Litvin, “Methods of the analysis and calculation of queuing systems with distributions of phase type,” Avtomatika i Telemekhanika, No. 5, 5–23 (1986).Google Scholar
  5. 5.
    Y. Takahashi and Y. Takami, “A numerical method for the steady-state probabilities of a GI / G / c queueing system in a general class,” J. Oper. Res. Soc. Japan, Vol. 19, No. 2, 147–157 (1976).MATHGoogle Scholar
  6. 6.
    Yu. I. Ryzhikov, “Recurrent calculation of multi-channel queueing systems with unlimited queue,” Avtomatika i Telemekhanika, No. 6, 88-93 (1985).Google Scholar
  7. 7.
    Yu. I. Ryzhikov, “An algorithm to design a multi-channel system with Erlangian service,” Avtomatika i Telemekhanika, No. 5, 30–37 (1980).Google Scholar
  8. 8.
    K. Yu. Zhernovyi, “Determining stationary characteristics of two-channel queueing systems with Erlangian distribution of service time,” Cybern. Syst. Analysis, Vol. 53, No. 1, 92–104 (2017).MathSciNetCrossRefMATHGoogle Scholar
  9. 9.
    Yu. V. Zhernovyi and K. Yu. Zhernovyi, “Determination of steady-state characteristics of three-channel queueing systems with Erlangian service times,” Cybern. Syst. Analysis, Vol. 53, No. 2, 134–145 (2017).MathSciNetCrossRefMATHGoogle Scholar
  10. 10.
    A. Chydziński, Nowe Modele Kolejkowe dla Węzlów Sieci Pakietowych, Pracownia Komputerowa Jacka Skalmierskiego, Gliwice (2013).Google Scholar
  11. 11.
    O. Tikhonenko and W. M. Kempa, “Queue-size distribution in M / G / 1-type system with bounded capacity and packet dropping,” Communications in Computer and Information Science, Vol. 356, 177–186 (2013).CrossRefMATHGoogle Scholar
  12. 12.
    Yu. Zhernovyi, B. Kopytko, and K. Zhernovyi, “On characteristics of the M θ / G /1/ m and M θ / G /1 queues with queue-size based packet dropping,” J. of Appl. Math. and Comput. Mech., Vol. 13, No. 4, 163–175 (2014).CrossRefGoogle Scholar
  13. 13.
    Yu. Zhernovyi, Creating Models of Queueing Systems using GPSS World: Programs, Detailed Explanations and Analysis of Results, LAP Lambert Academic Publishing, Saarbrucken (2015).Google Scholar

Copyright information

© Springer Science+Business Media, LLC, part of Springer Nature 2018

Authors and Affiliations

  1. 1.Ivan Franko National University of LvivLvivUkraine
  2. 2.Lviv Scientific and Training Institute “Banking University,”LvivUkraine

Personalised recommendations