Skip to main content

The Analytical Method of Transient Behavior of the M|M|1|n Queuing System for Piece-Wise Constant Information Flows

  • Conference paper
  • First Online:
Distributed Computer and Communication Networks: Control, Computation, Communications (DCCN 2021)

Abstract

The analytical method for studying the behavior of queuing system with abruptly changing information flows is presented in this paper for the first time. The proposed method is based on the conception of fundamental matrix of the Kolmogorov system and allows studying the transient and stationary modes of functioning different types of queuing system. The transient behavior of the M|M|1|n system with constant flows and piecewise constant arrival and service rates of flows are considered. It is obtained the analytical expressions for the state probabilities of the queuing system as in transient and in stationary mode. The conception of transient time for the queuing system has been introduced and the formulas for calculation of such transient performance metrics as throughput, a number of received and processed packets have been obtained for the first time.

The reported study was funded by RFBR, project number 19-29-06043.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 64.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 84.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

References

  1. Vishnevsky, V.M.: Theoretical Foundations for the Design of Computer Networks. Tekhnosfera, Moscow (2003)

    Google Scholar 

  2. Lakatos, L., Szeidl, L., Telek, M.: Introduction to Queuing Systems with Telecommunication Applications. Springer, Heidelberg (2013). https://doi.org/10.1007/978-1-4614-5317-8

  3. Vishnevsky, V.M., Portnoy, S.L., Shakhnovich, I.V.: Encyclopedia of WiMAX. In: The Path to 4G. Tekhnosfera, Moscow (2010)

    Google Scholar 

  4. Giambene, G.: Encyclopedia of WiMAX. In: The Path to 4G. Tekhnosfera, Moscow (2010)

    Google Scholar 

  5. Zukerman, M.: Introduction to queueing theory and stochastic teletraffic models. arXiv arXiv:1307.2968 (2013)

  6. Cohen, J.W.: The Single Server Queue, 2nd edn. North-Holland, Amsterdam (1982)

    MATH  Google Scholar 

  7. Prabhu, N.U.: Queues and Inventories. Wiley, New York (1965)

    MATH  Google Scholar 

  8. Harrison, P.G.: Transient behaviour of queueing networks. J. Appl. Probab. 18(2), 482–490 (1981)

    Article  MathSciNet  Google Scholar 

  9. Abate, J., Whitt, W.: Transient behavior of the \(M/M/1\) queue: starting at the origin. Queueing Syst. 2, 41–65 (1987)

    Article  MathSciNet  Google Scholar 

  10. Whitt, W.: Decomposition approximations for time-dependent Markovian queueing networks. Oper. Res. Lett. 24, 97–103 (1999)

    Article  MathSciNet  Google Scholar 

  11. Horváth, A., Angius, A.: Approximate transient analysis of queuing networks by decomposition based on time-inhomogeneous Markov arrival processes. EAI Endorsed Trans. IoT 1(2) (2014). https://doi.org/10.4108/icst.valuetools

  12. Kumar, R., Soodan, B.S.: Transient analysis of a single-server queuing system with correlated inputs and reneging. Reliab. Theor. Appl. 14(1), 102–106 (2019)

    Google Scholar 

  13. Kumar, R., Arivudainambi, D.: Transient solution of an M/M/1 queue with catastrophes. Comput. Math. Appl. 40, 1233–1240 (2000)

    Article  MathSciNet  Google Scholar 

  14. Sophia, S.: Transient analysis of a single server queue with chain sequence rates subject to catastrophes, failures and repairs. Int. J. Pure Appl. Math. 119(15), 1969–1988 (2018)

    Google Scholar 

  15. Kumar, R., Krishnamoorthy, A., Pavai, M.S., Sadiq, B.S.: Transient analysis of a single server queue with catastrophes, failures and repairs. Queueing Syst. Theor. Appl. 56(3–4), 133–141 (2007)

    Article  MathSciNet  Google Scholar 

  16. Rubino, G.: Transient analysis of Markovian queueing systems: a survey with focus on closed forms and uniformization, chap. 8. In: Advanced Trends in Queueing Theory 2, pp. 269–307 (2021)

    Google Scholar 

  17. Chan, R.H., Ma, K.C., Ching, W.K.: Boundary value methods for solving transient solutions of Markovian queueing networks. Appl. Math. Comput. 172(2), 690–700 (2006)

    MathSciNet  MATH  Google Scholar 

  18. Gantmacher, F.R.: The Theory of Matrices, vol. 1 and vol. 2. Chelsea Publishing Co. (1960)

    Google Scholar 

  19. Vytovtov, K., Barabanova, E., Vishnevskiy, V.: Accurate mathematical model of two-dimensional parametric systems based on \(2\times 2\) matrix. Commun. Comput. Inf. Sci. 1141, 199–211 (2019)

    Google Scholar 

  20. Vytovtov, K., Barabanova, E.: Mathematical model of four-dimensional parametric systems based on block diagonal matrix with \(2\times 2\) blocks. Commun. Comput. Inf. Sci. 1141, 139–155 (2019)

    Google Scholar 

  21. Barbashin, E.A.: Introduction to Stability Theory. Nauka, Moscow (1967)

    Google Scholar 

  22. Krivtsova, I., et al.: Implementing a broadcast storm attack on a mission-critical wireless sensor network. In: Mamatas, L., Matta, I., Papadimitriou, P., Koucheryavy, Y. (eds.) WWIC 2016. LNCS, vol. 9674, pp. 297–308. Springer, Cham (2016). https://doi.org/10.1007/978-3-319-33936-8_23

    Chapter  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2021 Springer Nature Switzerland AG

About this paper

Check for updates. Verify currency and authenticity via CrossMark

Cite this paper

Vytovtov, K., Barabanova, E., Vishnevsky, V. (2021). The Analytical Method of Transient Behavior of the M|M|1|n Queuing System for Piece-Wise Constant Information Flows. In: Vishnevskiy, V.M., Samouylov, K.E., Kozyrev, D.V. (eds) Distributed Computer and Communication Networks: Control, Computation, Communications. DCCN 2021. Lecture Notes in Computer Science(), vol 13144. Springer, Cham. https://doi.org/10.1007/978-3-030-92507-9_15

Download citation

  • DOI: https://doi.org/10.1007/978-3-030-92507-9_15

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-030-92506-2

  • Online ISBN: 978-3-030-92507-9

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics