Advertisement

The Renewal-Based Asymptotics and Accelerated Estimation of a System with Random Volume Customers

  • Evsey Morozov
  • Lyubov PotakhinaEmail author
Conference paper
Part of the Communications in Computer and Information Science book series (CCIS, volume 800)

Abstract

We consider a single-server system in which each customer is described by its service time and a random volume. The total volume of customers accepted by the system is upper bounded by a finite constant (system capacity) M. We give renewal-based approximations for a number of important stationary parameters of the system, in particular, the mean lost volume. For a large M, the loss is typically a rare event, and Crude Monte-Carlo method is time-consuming to obtain accurate estimate of the loss probability in an acceptable simulation time. We apply splitting method to speed-up estimation of the parameters by simulation. In particular, we focus on heavy load. We perform simulations for different values of capacity, different volume size distributions, including heavy- and light-tailed distributions, and also for different values of traffic intensity.

Keywords

Queueing system Random volume customer Finite capacity Accelerated simulation Splitting Heavy-tailed volume 

Notes

Acknowledgements

Research is supported by Russian Foundation for Basic Research, projects 15-07-02341, 15-07-02354, 15-07-02360.

References

  1. 1.
    Morozov, E., Potakhina, L., Tikhonenko, O.: Regenerative analysis of a system with a random volume of customers. In: Dudin, A., Gortsev, A., Nazarov, A., Yakupov, R. (eds.) ITMM 2016. CCIS, vol. 638, pp. 261–272. Springer, Cham (2016). doi: 10.1007/978-3-319-44615-8_23 CrossRefGoogle Scholar
  2. 2.
    Tikhonenko, O.M.: Queuing system with processor sharing and limited resources. Autom. Remote Control 71(5), 803–815 (2010)MathSciNetCrossRefzbMATHGoogle Scholar
  3. 3.
    Morozov, E., Nekrasova, R., Potakhina, L., Tikhonenko, O.: Asymptotic analysis of queueing systems with finite buffer space. In: Kwiecień, A., Gaj, P., Stera, P. (eds.) CN 2014. CCIS, vol. 431, pp. 223–232. Springer, Cham (2014). doi: 10.1007/978-3-319-07941-7_23 CrossRefGoogle Scholar
  4. 4.
    Asmussen, S.: Applied Probability and Queues, 2nd edn. Springer, New York (2003). doi: 10.1007/b97236 zbMATHGoogle Scholar
  5. 5.
    Feller, W.: An Introduction to Probability Theory and Its Applications. Wiley, New York (1971)zbMATHGoogle Scholar
  6. 6.
    Tikhonenko, O.: Determination of loss characteristics in queueing systems with demands of random space requirement. In: Dudin, A., Nazarov, A., Yakupov, R. (eds.) ITMM 2015. CCIS, vol. 564, pp. 209–215. Springer, Cham (2015). doi: 10.1007/978-3-319-25861-4_18 CrossRefGoogle Scholar
  7. 7.
    Botev, Z.I., Kroese, D.P.: Efficient Monte Carlo simulation via the generalized splitting method. Stat. Comput. 22(1), 1–16 (2012)MathSciNetCrossRefzbMATHGoogle Scholar
  8. 8.
    Rubinstein, R.Y., Ridder, A., Vaisman, R.: Fast Sequential Monte Carlo Methods for Counting and Optimization. Wiley, New York (2014)Google Scholar
  9. 9.
    Borodina, A.V.: Regenerative modification of the splitting method for overload probability estimation in queueing systems. Ph.D. thesis, The Petrozavodsk State University (2008). (in Russian)Google Scholar
  10. 10.
    Garvels, M.: The splitting method in rare event simulation. Ph.D. thesis, The University of Twente, The Netherlands (2000)Google Scholar
  11. 11.
    R Foundation for Statistical Computing, Vienna, Austria. http://www.R-project.org/. ISBN 3-900051-07-0
  12. 12.
    Center for collective use of Karelian Research Centre of Russian Academy of Science. http://cluster.krc.karelia.ru/
  13. 13.
    Garvels, M., Kroese, D.: A comparison of RESTART implementations. In: Proceedings of the 1998 Winter Simulation Conference, pp. 601–608 (1998)Google Scholar
  14. 14.
    Asmussen, S., Klppelberg, C., Sigman, C.: Sampling at subexponential times, with queueing applications. Stoch. Process. Appl. 79(2), 265–286 (1999)MathSciNetCrossRefzbMATHGoogle Scholar

Copyright information

© Springer International Publishing AG 2017

Authors and Affiliations

  1. 1.Institute of Applied Mathematical Research, Karelian Research CentrePetrozavodskRussia
  2. 2.Petrozavodsk State UniversityPetrozavodskRussia

Personalised recommendations