Skip to main content
SpringerLink
Log in

Analytical Investigation of a Single-Server Queueing System with an Incoming MAP Event Flow

  • STOCHASTIC SYSTEMS
  • Published:
Automation and Remote Control Aims and scope Submit manuscript

Abstract

This paper considers a single-server queueing system with an incoming Markovian Arrival Process (MAP) request flow with two states. Explicit expressions are derived for the stationary probability distribution of the states and several numerical characteristics of the system (the probability of idle time of the server, the expected number of requests in the system, and the mean queue length). The resulting numerical characteristics are presented in tables and plotted in graphical form as well. The recurrent MAP flow with two states as a special case of correlated MAP request flows is studied.

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.
Fig. 4.
Fig. 5.
Fig. 6.
Fig. 7.
Fig. 8.
Fig. 9.
Fig. 10.

REFERENCES

  1. Cox, D.R., The Analysis of Non-Markovian Stochastic Processes by the Inclusion of Supplementary Variables, Proceedings of the Cambridge Philosophical Society, 1955, vol. 51, no. 3, pp. 433–441.

    Article  MathSciNet  MATH  Google Scholar 

  2. Kingman, J.F.C., On Doubly Stochastic Poisson Processes, Proceedings of the Cambridge Philosophical Society, 1964, vol. 60, no. 4, pp. 923–930.

    Article  MathSciNet  MATH  Google Scholar 

  3. Basharin, G.P., Kokotushkin, V.A., and Naumov, V.A., On the Equivalent Change Method to Calculate Fragments of Communication Networks. Part 1, Izv. Akad. Nauk SSSR. Tekh. Kibern., 1979, no. 6, pp. 92–99.

  4. Basharin, G.P., Kokotushkin, V.A., and Naumov, V.A., On the Equivalent Change Method to Calculate Fragments of Communication Networks. Part 2, Izv. Akad. Nauk SSSR. Tekh. Kibern., 1980, no. 1, pp. 55–61.

  5. Neuts, M.F., A Versatile Markov Point Process, J. Appl. Probab., 1979, vol. 16, no. 4, pp. 764–779.

    Article  MathSciNet  MATH  Google Scholar 

  6. Lucantoni, D.M., New Results on the Single Server Queue with a Batch Markovian Arrival Process, Communications in Statistics. Stochastic Models, 1991, vol. 7, no. 1, pp. 1–46.

    Article  MathSciNet  MATH  Google Scholar 

  7. Lucantoni, D.M. and Neuts, M.F., Some Steady-State Distributions for the MAP/SM/1 Queue, Communications in Statistics. Stochastic Models, 1994, vol. 10, no. 3, pp. 575–598.

    Article  MathSciNet  MATH  Google Scholar 

  8. Vishnevsky, V.M., Dudin, A.N., and Klimenok, V.I., The Theory of Queuing Systems with Correlated Flows, Heidelberg: Springer, 2020.

    MATH  Google Scholar 

  9. Gortsev, A.M. and Solov’ev, A.A., The Probability of Error in Estimating the States of Physical Event Flows, Izv. Vuzov. Fizika, 2016, vol. 59, no. 5, pp. 54–60.

    Google Scholar 

  10. Gortsev, A.M., Nezhel’skaya, L.A., and Solov’ev, A.A., Optimal State Estimation in MAP Event Flows with Unextendable Dead Time, Autom. Remote Control, 2012, vol. 73, no. 8, pp. 1316–1326.

    Article  MathSciNet  MATH  Google Scholar 

  11. Gortzev, A.M. and Soloviev, A.A., The Joint Density of Probability for Intervals of MAP Event Flows and Conditions of Its Recurrence, Tomsk State Univ. J. Control Comp. Sci., 2012, no. 3(20), pp. 32–41.

  12. Gortzev, A.M. and Solovev, A.A., Comparison of ML- and M-Estimates for Unextandable Dead Time in MAP Event Flow, Tomsk State Univ. J. Control Comp. Sci., 2015, no. 4(33), pp. 13–22.

  13. Gortsev, A.M. and Solov’ev, A.A., The Joint Probability Density of Physical Event Flow Intervals with Unextendable Dead Time, Izv. Vuzov. Fizika, 2014, vol. 57, no. 7, pp. 103–111.

    Google Scholar 

  14. Gortsev, A.M. and Solov’ev, A.A., A Maximum Likelihood Estimate for Unextendable Dead Time in a Physical Event Flow, Izv. Vuzov. Fizika, 2015, vol. 58, no. 11, pp. 141–149.

    Google Scholar 

  15. Bin Sun, Dudin, S.A., Dudina, O.S., and Dudin, A.N., A Customer Service Model in an Adaptive-Modulation Mobile Communication Cell with Allowance for Random Environment, Autom. Remote Control, 2021, vol. 82, no. 5, pp. 812–826.

    Article  MathSciNet  MATH  Google Scholar 

  16. Gortsev, A.M. and Nezhelskaya, L.A., Analytical Investigation of a Single-Channel QS with Incoming Asynchronous Event Flow, Autom. Remote Control, 2022, vol. 83, no. 8, pp. 1200–1212.

    Article  MathSciNet  MATH  Google Scholar 

  17. Nezhel’skaya, L.A., Otsenka sostoyanii dvazhdy stokhasticheskikh potokov sobytii (State Estimation for Doubly Stochastic Event Flows), Tomsk: Tomsk State Univ., 2020.

  18. Medvedev, G.A., Analysis of Stochastic Graphs Describing the Behavior of Stepped Automatic Search Systems, Avtomat. Vychisl. Tekh., 1968, no. 4, pp. 27–30.

Download references

Author information

Authors and Affiliations

  1. National Research Tomsk State University, Tomsk, Russia

    A. M. Gortsev & L. A. Nezhelskaya

Authors
  1. A. M. Gortsev
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. L. A. Nezhelskaya
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding authors

Correspondence to A. M. Gortsev or L. A. Nezhelskaya.

Additional information

This paper was recommended for publication by V.M. Vishnevsky, a member of the Editorial Board

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Gortsev, A.M., Nezhelskaya, L.A. Analytical Investigation of a Single-Server Queueing System with an Incoming MAP Event Flow. Autom Remote Control 84, 673–686 (2023). https://doi.org/10.1134/S000511792307007X

Download citation

  • Received:

  • Revised:

  • Accepted:

  • Published:

  • Issue Date:

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

Keywords:

Search

Navigation