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.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
References
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
Tikhonenko, O.M.: Queuing system with processor sharing and limited resources. Autom. Remote Control 71(5), 803–815 (2010)
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
Asmussen, S.: Applied Probability and Queues, 2nd edn. Springer, New York (2003). doi:10.1007/b97236
Feller, W.: An Introduction to Probability Theory and Its Applications. Wiley, New York (1971)
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
Botev, Z.I., Kroese, D.P.: Efficient Monte Carlo simulation via the generalized splitting method. Stat. Comput. 22(1), 1–16 (2012)
Rubinstein, R.Y., Ridder, A., Vaisman, R.: Fast Sequential Monte Carlo Methods for Counting and Optimization. Wiley, New York (2014)
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)
Garvels, M.: The splitting method in rare event simulation. Ph.D. thesis, The University of Twente, The Netherlands (2000)
R Foundation for Statistical Computing, Vienna, Austria. http://www.R-project.org/. ISBN 3-900051-07-0
Center for collective use of Karelian Research Centre of Russian Academy of Science. http://cluster.krc.karelia.ru/
Garvels, M., Kroese, D.: A comparison of RESTART implementations. In: Proceedings of the 1998 Winter Simulation Conference, pp. 601–608 (1998)
Asmussen, S., Klppelberg, C., Sigman, C.: Sampling at subexponential times, with queueing applications. Stoch. Process. Appl. 79(2), 265–286 (1999)
Acknowledgements
Research is supported by Russian Foundation for Basic Research, projects 15-07-02341, 15-07-02354, 15-07-02360.
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2017 Springer International Publishing AG
About this paper
Cite this paper
Morozov, E., Potakhina, L. (2017). The Renewal-Based Asymptotics and Accelerated Estimation of a System with Random Volume Customers. In: Dudin, A., Nazarov, A., Kirpichnikov, A. (eds) Information Technologies and Mathematical Modelling. Queueing Theory and Applications. ITMM 2017. Communications in Computer and Information Science, vol 800. Springer, Cham. https://doi.org/10.1007/978-3-319-68069-9_9
Download citation
DOI: https://doi.org/10.1007/978-3-319-68069-9_9
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-68068-2
Online ISBN: 978-3-319-68069-9
eBook Packages: Computer ScienceComputer Science (R0)