Skip to main content
SpringerLink
Log in

On the Parameter Selection of a Query Flow Control System Using the Probabilistic Pushing Out Mechanism

  • DATA PROCESSING AND IDENTIFICATION
  • Published:
Journal of Computer and Systems Sciences International Aims and scope

Abstract

A telematics device is modeled as a two-stream Markov one-channel priority queuing system of finite capacity equipped with a probabilistic pushing out mechanism. Its probability, \(0 \leqslant \alpha \leqslant 1\), of pushing out is the control parameter of the queuing system. It is experimentally and theoretically proved that on the plane of the load factors for high-priority and low-priority traffic, there are regions within which each of the loss probabilities depends on parameter α in a linear manner. The shape of these linearity regions is studied in detail for the case of absolute and relative priority, for each of which the limits of applicability of the linear loss law are constructed. The optimal value of the pushing out probability α is obtained according to the criterion of the minimal probability of losing high-priority claims under the condition of limiting the probability of losing low-priority claims. The described method was used to remotely control robotic devices under the conditions of the Kontur space experiment onboard the International Space Station.

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

Fig. 1.
Fig. 2.
Fig. 3.

Similar content being viewed by others

REFERENCES

  1. V. Zaborovsky, V. Muliukha, and A. Ilyashenko, “Cyber-physical approach in a series space experiments ‘Kontur’,” Lect. Notes Comput. Sci. 9247, 745–758 (2015).

    Article  Google Scholar 

  2. A. S. Tanenbaum and D. J. Wetherall, Network Computers (Prentice Hall, Boston, 2011).

    Google Scholar 

  3. S. P. Sushchenko, Mathematical Models of Computer Networks (TGU, Tomsk, 2017) [in Russian].

    Google Scholar 

  4. V. M. Vishnevskii, Theoretical Foundations of Computer Network Design (Tekhnosfera, Moscow, 2003) [in Russian].

    Google Scholar 

  5. O. I. Zayats, V. S. Zaborovskii, V. A. Mulyukha, and A. S. Verbenko, “Packet switching management in telematics devices with finite buffer size using preemptive priority queueing and randomized push-out mechanism. Part 1,” Program. Inzhen., No. 2, 22–27 (2012).

  6. N. K. Jaiswal, Priority Queues (Elsevier, Amsterdam, 1968).

    MATH  Google Scholar 

  7. B. V. Gnedenko, E. A. Danielyan, B. N. Dimitrov, G. P. Klimov, and V. F. Matveev, Priority Service Systems (Mosk. Gos. Univ., Moscow, 1973) [in Russian].

    Google Scholar 

  8. G. P. Basharin, “Some results for systems with priority,” in Mass Service in Information Transfer Systems (Nauka, Moscow, 1969), pp. 39–53.

    Google Scholar 

  9. K. E. Avrachenkov, G. L. Shevlyakov, and N. O. Vilchevsky, “Randomized push-out disciplines in priority queueing,” Math. Sci. 122, 3336–3342 (2004).

    Article  MathSciNet  Google Scholar 

  10. K. E. Avrachenkov, N. O. Vilchevsky, and G. L. Shevlyakov, “Priority queueing with finite buffer size and randomized push-out mechanism,” Perform. Eval. 61, 1–16 (2005).

    Article  Google Scholar 

  11. A. Ilyashenko, O. Zayats, V. Muliukha, and L. Laboshin, “Further investigations of the priority queueing system with preemptive priority and randomized push-out mechanism,” Lect. Notes Comp. Sci. 8638, 433–443 (2014).

    Article  Google Scholar 

  12. V. Muliukha, A. Ilyashenko, O. Zayats, and V. Zaborovsky, “Preemptive queueing system with randomized push-out mechanism,” Commun. Nonlin. Sci. Numer. Simul. 21, 147–158 (2015).

    Article  MathSciNet  Google Scholar 

  13. A. Ilyashenko, O. Zayats, V. Muliukha, and A. Lukashin, “Alternating priorities queing system with randomized push-out mechanism,” Lect. Notes Comp. Sci. 9247, 436–445 (2015).

    Article  Google Scholar 

  14. A. Ilyashenko, O. Zayats, and V. Muliukha, “Randomized priorities in queueing system with randomized push-out mechanism,” Lect. Notes Comp. Sci. 9870, 230–237 (2016).

    Article  Google Scholar 

  15. O. Zayats, M. Korenevskaya, A. Ilyashenko, and A. Lukashin, “Retrial queueing system in series of space experiments 'Kontur',” Proc. Comput. Sci. 103, 562–568 (2017).

    Article  Google Scholar 

  16. A. Ilyashenko, O. Zayats, M. Korenevskaya, and V. Muliukha, “A retrial queueing system with preemptive priority and randomized push-out mechanism,” Lect. Notes Comp. Sci. 10531, 432–440 (2017).

    Article  Google Scholar 

  17. M. Korenevskaya, O. Zayats, A. Ilyashenko, and V. Muliukha, “The phenomenon of secondary flow explosion in retrial priority queueing system with randomized push-out mechanism,” Lect. Notes Comp. Sci. 11118, 236–246 (2018).

    Article  Google Scholar 

  18. M. Korenevskaya, O. Zayats, A. Ilyashenko, and V. Muliukha, “Retrial queueing system with randomized push-out mechanism and non-preemptive priority,” Proc. Comput. Sci. 150, 716–725 (2019).

    Article  Google Scholar 

  19. P. Shorenko, O. Zayats, A. Ilyashenko, and V. Muliukha, “Preemptive queueing system with randomized push-out mechanism and negative customers,” Lect. Notes Comp. Sci. 11660, 305–317 (2019).

    Article  Google Scholar 

  20. H. White and L. S. Christie, “Queueing with preemptive priorities or with breakdown,” Oper. Res. 6, 79–95 (1958).

    Article  Google Scholar 

  21. F. F. Stephan, “Two queues under preemptive priority with Poisson arrival and service rates,” Oper. Res. 6, 399–418 (1958).

    Article  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Peter the Great St. Petersburg Polytechnic University, 195251, St. Petersburg, Russia

    V. S. Zaborovskii, O. I. Zayats, A. S. Il’yashenko & V. A. Mulyukha

Authors
  1. V. S. Zaborovskii
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. O. I. Zayats
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. A. S. Il’yashenko
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. V. A. Mulyukha
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding authors

Correspondence to V. S. Zaborovskii or O. I. Zayats.

Additional information

Translated by A. Ivanov

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Zaborovskii, V.S., Zayats, O.I., Il’yashenko, A.S. et al. On the Parameter Selection of a Query Flow Control System Using the Probabilistic Pushing Out Mechanism. J. Comput. Syst. Sci. Int. 60, 1–8 (2021). https://doi.org/10.1134/S1064230721010135

Download citation

  • Received:

  • Revised:

  • Accepted:

  • Published:

  • Issue Date:

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

Search

Navigation