Skip to main content
SpringerLink
Log in

Recurrence Relations for Two-Channel Queuing Systems with Erlangian Service Time

  • Published:
Cybernetics and Systems Analysis Aims and scope

Abstract

We propose a method to investigate M / Es / 2 / m and M / Es / 2 /∞ queueing systems including the case of random dropping of customers. Recurrence relations are obtained for computing the stationary distribution of the number of customers in the system and its steady-state characteristics. The developed algorithms are tested on examples using simulation models constructed with the help of the GPSS World tools.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. E. Brockmeyer, H. L. Halstrom, and A. Jensen, The Life and Works of A.K. Erlang, Danish Academy of Technical Sciences, Copenhagen (1948).

    MATH  Google Scholar 

  2. M. F. Neuts, Matrix-Geometric Solutions in Stochastic Models, The Johns Hopkins University Press, Baltimore (1981).

    MATH  Google Scholar 

  3. P. P. Bocharov and A. V. Pechinkin, Queuing Theory [in Russian], RUDN, Moscow (1995).

    Google Scholar 

  4. P. P. Bocharov and V. G. Litvin, “Methods of the analysis and calculation of queuing systems with phase-type distributions,” Avtomatika i Telemekhanika, No. 5, 5–23 (1986).

    Google Scholar 

  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).

    MATH  Google Scholar 

  6. Yu. I. Ryzhykov, “Recurrent calculation of multi-channel queueing systems with unlimited queue,” Avtomatika i Telemekhanika, No. 6, 88–93 (1985).

  7. Yu. I. Ryzhykov, “Algorithms of calculation of a multi-channel system with Erlangian service,” Avtomatika i Telemekhanika, No. 5, 30–37 (1980).

  8. A. Chydzin’ski, Nowe modele kolejkowe dla wezlow sieci pakietowych [in Polish], Pracownia Komputerowa Jacka Skalmierskiego, Gliwice (2013).

    Google Scholar 

  9. 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).

    Article  MATH  Google Scholar 

  10. 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 Applied Mathematics and Computational Mechanics, Vol. 13, No. 4, 163–175 (2014).

    Article  Google Scholar 

  11. 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).

    Article  MathSciNet  MATH  Google Scholar 

  12. 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, 280–292 (2017).

    Article  MathSciNet  MATH  Google Scholar 

  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 

Download references

Author information

Authors and Affiliations

  1. Ivan Franko National University of Lviv, Lviv, Ukraine

    Yu. V. Zhernovyi

Authors
  1. Yu. V. Zhernovyi
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Yu. V. Zhernovyi.

Additional information

Translated from Kibernetika i Sistemnyi Analiz, No. 3, May–June, 2018, pp. 151–159.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Zhernovyi, Y.V. Recurrence Relations for Two-Channel Queuing Systems with Erlangian Service Time. Cybern Syst Anal 54, 476–483 (2018). https://doi.org/10.1007/s10559-018-0048-6

Download citation

  • Received:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10559-018-0048-6

Keywords

Search

Navigation