Skip to main content

Resource Queueing System \(M/GI/\infty \) in a Random Environment

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

Abstract

In this paper, we consider an infinite-service resource queueing system \(M/GI/\infty \) operating in a random environment. When the environment changes its state, the service time and the occupied resource do not change for the customers already under service, however, for the new customers the arrival rate, the service time distribution, and resource requirements are changed. We apply the dynamic screening method and perform asymptotic analysis to find the approximation of the probability of the total amount of occupied resource.

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

Similar content being viewed by others

References

  1. 3GPP: Study on Enhancement of Network Slicing (Release 16). 3GPP TS 23.740 V16.0.0 (December 2018)

    Google Scholar 

  2. Boxma, O.J., Kurkova, I.A.: The M/M/1 queue in a heavy-tailed random environment. Stat. Neerl. 54(2), 221–236 (2000). https://doi.org/10.1111/1467-9574.00138

    Article  MathSciNet  MATH  Google Scholar 

  3. Choudhury, G.L., Mandelbaum, A., Reiman, M.I., Whitt, W.: Fluid and diffusion limits for queues in slowly changing environments. Commun. Stat. Stoch. Models 13(1), 121–146 (1997). https://doi.org/10.1080/15326349708807417

    Article  MathSciNet  MATH  Google Scholar 

  4. Cordeiro, J.D., Kharoufeh, J.P.: The unreliable M/M/1 retrial queue in a random environment. Stoch. Model. 28(1), 29–48 (2012). https://doi.org/10.1080/15326349.2011.614478

    Article  MathSciNet  MATH  Google Scholar 

  5. Dammer, D.: Research of mathematical model of insurance company in the form of queueing system in a random environment. In: Dudin, A., Nazarov, A., Kirpichnikov, A. (eds.) ITMM 2017. CCIS, vol. 800, pp. 204–214. Springer, Cham (2017). https://doi.org/10.1007/978-3-319-68069-9_17

    Chapter  MATH  Google Scholar 

  6. D’Auria, B.: \(M/M/\infty \) queues in semi-Markovian random environment. Queueing Syst. 58(3), 221–237 (2008). https://doi.org/10.1007/s11134-008-9068-7

    Article  MathSciNet  MATH  Google Scholar 

  7. D’Auria, B.: Stochastic decomposition of the queue in a random environment. Oper. Res. Lett. 35(6), 805–812 (2007). https://doi.org/10.1016/j.orl.2007.02.007

    Article  MathSciNet  MATH  Google Scholar 

  8. Jiang, T., Liu, L., Li, J.: Analysis of the M/G/1 queue in multi-phase random environment with disasters. J. Math. Anal. Appl. 430(2), 857–873 (2015). https://doi.org/10.1016/j.jmaa.2015.05.028

    Article  MathSciNet  MATH  Google Scholar 

  9. Krenzler, R., Daduna, H.: Loss systems in a random environment: steady state analysis. Queueing Syst. 80(1-2), 127–153 (2014). https://doi.org/10.1007/s11134-014-9426-6

  10. Krishnamoorthy, A., Jaya, S., Lakshmy, B.: Queues with interruption in random environment. Ann. Oper. Res. 233(1), 201–219 (2015). https://doi.org/10.1007/s10479-015-1931-4

    Article  MathSciNet  MATH  Google Scholar 

  11. Lisovskaya, E.Y., Moiseev, A.N., Moiseeva, S.P., Pagano, M.: Modeling of mathematical processing of physics experimental data in the form of a non-Markovian multi-resource queuing system. Russ. Phys. J. 61(12), 2188–2196 (2019). https://doi.org/10.1007/s11182-019-01655-6

    Article  Google Scholar 

  12. Liu, Y., Honnappa, H., Tindel, S., Yip, N.K.: Infinite server queues in a random fast oscillatory environment. Queueing Syst. 98(1-2), 145–179 (2021). https://doi.org/10.1007/s11134-021-09704-z

  13. Liu, Z., Yu, S.: The M/M/C queueing system in a random environment. J. Math. Anal. Appl. 436(1), 556–567 (2016). https://doi.org/10.1016/j.jmaa.2015.11.074

    Article  MathSciNet  MATH  Google Scholar 

  14. Moiseev, A., Nazarov, A.: Queueing network \(MAP-(GI/\infty )^K\) with high-rate arrivals. Eur. J. Oper. Res. 254(1), 161–168 (2016). https://doi.org/10.1016/j.ejor.2016.04.011

    Article  MathSciNet  MATH  Google Scholar 

  15. Naumov, V.A., Samuilov, K.E., Samuilov, A.K.: On the total amount of resources occupied by serviced customers. Autom. Remote. Control. 77(8), 1419–1427 (2016). https://doi.org/10.1134/s0005117916080087

    Article  MathSciNet  MATH  Google Scholar 

  16. Nazarov, A., Baymeeva, G.: The M/G/\(\infty \) queue in random environment. In: Dudin, A., Nazarov, A., Yakupov, R., Gortsev, A. (eds.) ITMM 2014. CCIS, vol. 487, pp. 312–324. Springer, Cham (2014). https://doi.org/10.1007/978-3-319-13671-4_36

    Chapter  Google Scholar 

  17. Samdanis, K., Costa-Perez, X., Sciancalepore, V.: From network sharing to multi-tenancy: the 5g network slice broker. IEEE Commun. Mag. 54(7), 32–39 (2016). https://doi.org/10.1109/MCOM.2016.7514161

    Article  Google Scholar 

  18. Sopin, E., Vikhrova, O., Samouylov, K.: LTE network model with signals and random resource requirements. In: 2017 9th International Congress on Ultra Modern Telecommunications and Control Systems and Workshops (ICUMT) (2017). https://doi.org/10.1109/icumt.2017.8255155

  19. Tikhonenko, O.M.: Queuing system with processor sharing and limited resources. Autom. Remote. Control. 71(5), 803–815 (2010). https://doi.org/10.1134/s0005117910050073

    Article  MathSciNet  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Ekaterina Lisovskaya .

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

Krishtalev, N., Lisovskaya, E., Moiseev, A. (2021). Resource Queueing System \(M/GI/\infty \) in a Random Environment. 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_18

Download citation

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

  • 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