Skip to main content
SpringerLink
Log in

Multiserver systems with rejections and the equiprobable distribution of customers

  • Mathematical Models and Computational Methods
  • Published:
Journal of Communications Technology and Electronics Aims and scope Submit manuscript

Abstract

The queueing systems with rejections, arbitrary service time distributions, and two ways of the distributions of customers over heterogeneous servers (the equiprobable customer distribution over all (idle and busy) servers and the equiprobable customer distribution over idle servers) are discussed and used to find the stationary distributions of the number of customers. Their invariance with respect to service time distribution functions is proved. For an M X/M/n/0 system with homogeneous servers and the equiprobable customer distribution over all servers, the algorithm is proposed for determining the stationary distributions of the number of customers when their number in the batch is less than six. M X/M/2/0 and M X/M/3/0 systems with the equiprobable customer distribution over all servers and the arbitrary distribution of the number of arriving customers are studied. The results are checked using simulation models based on GPSS World software.

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. A. N. Dudin and V. I. Klimenok, “Calculation of required number of canals in modern telecommunications networks,” Informatiz. Obrazovaniya, No. 4, 56–68 (2005).

    Google Scholar 

  2. A. A. Nazarov, “Engset formulas for inhomogeneous non-markovian queueing systems and their application in telecommunications,” Problemy Peredachi Inf. 34(2), 109–116 (1998).

    Google Scholar 

  3. B. A. Sevast’yanov, “Ergodic theorem for Markovian processes and its applications to telephonic systems with failures,” Teor. Veroyatn. Primen. 2(1), 106–116 (1957).

    MATH  MathSciNet  Google Scholar 

  4. B. V. Gnedenko and I. N. Kovalenko, Introduction to Queueing Theory (Nauka, Moscow, 1966; Israel Program for Scientific Translations, Jerusalem, 1968).

    Google Scholar 

  5. D. König and D. Stoyan, Methoden der Bedingungstheorie (Akademie-Verlag Berlin, 1976; Radio i svyaz’, Moscow, 1981) [in Russian].

    Google Scholar 

  6. V. F. Matveev and V. G. Ushakov, Queueing Systems (Mosk. Gos. Univ., Moscow, 1984) [in Russian].

    MATH  Google Scholar 

  7. L. A. Ovcharov, Applied Problems of Queueing Theory (Mashinostroenie, Moscow, 1969) [in Russian].

    Google Scholar 

  8. D. V. Efrosinin and V. V. Rykov, “To analysis capacity rating of queueing systems with heterogeneous devices,” Avtom. Telemekh., No. 1, 64–82 (2008) [in Russian].

    Google Scholar 

  9. V. D. Boev, System Simulation. GPSS World Tools (BKhV-Peterburg, St. Petersburg, 2004) [in Russian].

    Google Scholar 

  10. Yu. V. Zhernovyi, Simulation of Queueing Systems (L’viv. Nat. Univ., L’viv, 2007) [in Ukrainian].

    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

Additional information

Original Russian Text © Yu.V. Zhernovyi, 2013, published in Informatsionnye Protsessy, 2013, Vol. 13, No. 1, pp. 19–34.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Zhernovyi, Y.V. Multiserver systems with rejections and the equiprobable distribution of customers. J. Commun. Technol. Electron. 58, 1257–1266 (2013). https://doi.org/10.1134/S106422691312019X

Download citation

  • Received:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1134/S106422691312019X

Keywords

Search

Navigation