Cybernetics And Systems Analysis logo
Editorial Board Announcements Abstracts Authors Archive
Cybernetics And Systems Analysis
International Theoretical Science Journal
-->

UDC 519.872
M.Yu. Kuznetsov1, A.A. Shumska2


1 V.M. Glushkov Institute of Cybernetics of the NAS of Ukraine, Kyiv, Ukraine

kuznetsov2016@icloud.com

2 National Technical University of Ukraine “Igor Sikorsky Kyiv Polytechnic Institute,” Kyiv, Ukraine

shumska-aa@ukr.net

FAST SIMULATION OF STEADY-STATE CALL BLOCKING PROBABILITY
IN A TWO-CHANNEL SYSTEM WITH THRESHOLD SERVICE STRATEGIES

Abstract. A model of a queueing system consisting of two service channels is considered. Each channel receives calls from several Poisson flows of different types. A call of each flow requires a certain resource for its service. Threshold service strategies are defined that make it possible to redirect a call from one channel to another. Blocking of calls of a certain flow occurs if each channel does not have sufficient service resources. All calls coming in a system-blocking state are lost. To evaluate the steady-state probability of blocking calls of a certain flow, a fast simulation method is proposed. The accuracy of the estimates is illustrated by numerical examples. The possibility of the insensitivity of the steady-state blocking probabilities with respect to the form of service time distributions by fixed means is investigated.

Keywords: queueing system, blocking state, resource, steady-state probability, Monte–Carlo method, stratified sampling, fast simulation, variance of estimate.


full text

REFERENCES

  1. Fortet R.M. Random distributions with an application to telephone engineering. Proc. Berkeley Sympos. Math. Stat. and Prob. Berkeley. 1956. Vol. 2. P. 81–88.

  2. Sevastyanov B.A. Limit theorem for Markov processes and its application to telephone systems with failures. Probability theory and its applications. 1957. Vol. 2, N 1. С. 106–116.

  3. Maryanovich T.P. Generalization of the Erlang formulas for the case where devices can fail and be restored. Ukr. math. journal. 1960. Vol. 12, N 3. P. 279–286.

  4. Kovalenko I.N. On the condition of independence of stationary distributions from the form of the law of distribution of service time. Problemy peredachi informatsii. 1963. Iss. 11. P. 147–151.

  5. Knig D., Matthes K., Nawrotzki K. Verallgemeinerungen der Erlangschen und Engsetschen Formeln. Berlin: Akademie-Verlag, 1967. 123 S.

  6. Kovalenko I.N. To the calculation of amendments to the characteristics of QS. Problems of stability of stochastic models. Moscow: VNIISI, 1986. P. 45–48.

  7. Kuznetsov N.Yu. Analytical-statistical method for constructing quantitative estimates of the continuity of the characteristics of queuing systems and redundant systems. Problems of stability of stochastic models. Moscow: VNIISI, 1986. P. 54–62.

  8. Kovalenko I.N., Kuznetsov N.Yu. Methods for calculating highly reliable systems [in Russian]. Moscow: Radio i svyaz', 1988. 176 p.

  9. Kuznetsov N.Yu. Finding stationary probabilities of system states with an incoming flow of requirements close to Poisson. Kibernetika. 1984. N 2. P. 74–79.

  10. Kuznetsov N.Yu., Shumskaya A.A. Estimation of the deviation of the stationary probabilities of the system from the probabilities of the system states by the analytical-statistical method. Kibernetika i sistemnyj analiz. 2013. N 5. P. 51–60.

  11. Kuznetsov M.Yu., Kuznetsov I.M., Shumska A.A. Finding a stochastic gradient to optimize the efficiency of systems described by failure trees with efficiency. International Scientific and Technical Journal Problems of Control and Informatics". 2022. N 4. P. 76–88.

  12. Sagkriotis S.G., Pantelis S.K., Moscholios I.D., Vassilakis V.G. Call blocking probabilities in a two-link multirate loss system for Poisson traffic. IET Networks. 2018. Vol. 7, N 4. P. 233–241.

  13. Kuznetsov N.Yu., Kuznetsov I.N. Accelerated Simulation of Claim Blocking Probability in Multi-Access Service Networks. Kibernetika i sistemnyj analiz. 2021. Vol. 57, N 4. P. 30–43.




© 2023 Kibernetika.org. All rights reserved.