Skip to main content
SpringerLink
Log in

Solution to optimal synthesis problems for certain Markov models of quereing

  • Articles from the Russian Journal Informatsionnye Protsessy
  • Published:
Journal of Communications Technology and Electronics Aims and scope Submit manuscript

Abstract

The conditions of the monotonic dependence between the stationary characteristics (the request loss probability, the average queue length, and the average time of request waiting in queue in the M/M/1/r queueing system (QS) and the average time of request waiting in queue in the other systems) and the system parameters (the buffer capacity, the loading coefficient of the system, the number of servers, and the threshold level of switching of servicing modes) have been determined in the M/M/1/r and M/M/n QSs, the M/M/1 QS with threshold switching of servicing modes at the instant of a change in the number of requests, and the M/M/1/ QS with threshold blocking of a request flow. The monotonicity properties of characteristics are employed to solve the optimal synthesis problems of systems with specified stationary characteristics. The calculated data have been verified via simulation models constructed in the GPSS World software environment.

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. Rykov V.V. “Dirigible Queueing Systems,” Itogi Nauki Tekh., Ser.: Teor. Veroyatn., Mat. Stat., Teor. Kibern. 12, 43–153 (1975).

    MathSciNet  Google Scholar 

  2. A. D. Solov’ev, “Problem on Optimal Service,” Izv. Akad. Nauk SSSR, Tekhn. Kibernetika, No. 5, pp. 40–50 (1970).

  3. A. N. Dudin, G. A. Medvedev, and Yu. V. Melenets, Practical Work with Computer on Queueing Theory (Elektron. Kniga, Belorus. Gos. Univ., Minsk, 2003) [in Russian].

    Google Scholar 

  4. S. P. Bobkov, N. M. Uryupina, and A. I. Ivannikov, “Optimization of Queueing System Structure,” Sovrem. Naukoemkie Tekhn., No. 3 (Suppl. 1), pp. 5–8 (2006).

  5. L. I. Samochernova, “Optimization of Queueing System with Variable Intensity, Depending on the Time-out,” Izv. Tomsk. Politekh. Univ. 315, 178–182 (2009).

    Google Scholar 

  6. K. Zhernovyi, “Optimization of Service Regimes for Systems M/M/1/m and M/M/1 with Blocking of Input Flow,” Visn. L’viv. Univ., Ser.: Mekh. Mat., No. 71, 92–101 (2009).

  7. A. N. Dudin and V. I. Klimenok, “Calculation of Necessary Number of Canals in Contemporary Telecommunications Networks,” Informatizatsiya Obrazovan., No. 4, pp. 56–68 (2005).

  8. A. M. Bratiichuk, Candidate’s Dissertation in Systems Analysis (Kiev. Nats. Univ. im. T. Shevchenko, Kiev, 2008).

    Google Scholar 

  9. K. Yu. Zhernovyi, “Investigation of the Mθ/G/1/m System with Service Regime Switchings and Threshold Blocking of Input Flow,” Inf. Protsessy 10, 159–180 (2010).

    Google Scholar 

  10. Ya. Yeleiko, Yu. Zhernovyi, “Universal Formulas for M/M/n/m Queueing System with Blocking of Input Flow,” Visn. L’viv. Univ., Ser.: Prikl. Mat. Informatika, No. 15, 234–239 (2009).

  11. V. V. Chaplygin, “Multiserver Queueing System with Terminal Hoarder and Blockage of Semi-Markov Stream of Applications,” Inf. Protsessy 8, pp. 1–9 (2008).

    Google Scholar 

  12. Yu. V. Zhernovyi, “Network Models M/M/n/r with Service Mode Switching in Moments of Change of Number of Requests,” Inf. Protsessy 10, 68–77 (2010).

    Google Scholar 

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

    Google Scholar 

  14. Yu. V. Zhernovyi, Simulation of Queueing Systems (L’viv. Nats. Univ., L’viv, 2007).

    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, 2010, published in Informatsionnye Protsessy, 2010, Vol. 10, No. 3, pp. 257–274.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Zhernovyi, Y.V. Solution to optimal synthesis problems for certain Markov models of quereing. J. Commun. Technol. Electron. 56, 1597–1608 (2011). https://doi.org/10.1134/S1064226911120266

Download citation

  • Received:

  • Published:

  • Issue Date:

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

Keywords

Search

Navigation