Skip to main content

Regenerative Analysis of a System with a Random Volume of Customers

  • Conference paper
  • First Online:
Information Technologies and Mathematical Modelling - Queueing Theory and Applications (ITMM 2016)

Abstract

We study a general multi-server system in which each customer has service time and a random volume. We consider two main cases: (i) the total volume of the present customers is unlimited and (ii) this volume is upper bounded by a finite constant. For this system, using the regenerative approach, we develop performance analysis. We establish a solidarity property of the basic processes: accumulated volume, waiting time (workload) and queue size. In case (i), we prove an analog of Little’s formula and, provided the system is single-server and the input is Poisson, the Pollaczeck-Khintchine formula. In case (ii), we suggest an approximation of the Pollaczeck-Khintchine formula, which is then verified by simulation.

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 39.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.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. Asmussen, S.: Applied Probability and Queues. Springer, New York (2003)

    MATH  Google Scholar 

  2. Morozov, E.: The tightness in the ergodic analysis of regenerative queueing processes. Queueing Syst. 27, 179–203 (1997)

    Article  MathSciNet  MATH  Google Scholar 

  3. Morozov, E., Delgado, R.: Stability analysis of regenerative queueing systems. Autom. Remote Control 70(12), 1977–1991 (2009)

    Article  MathSciNet  MATH  Google Scholar 

  4. Morozov, E., Potakhina, L., Rumyantsev, A.: Stability analysis and simulation of a state-dependent transmission rate system. ManMach. Interact. 4, 673–683 (2015)

    Google Scholar 

  5. Morozov, E., Nekrasova, R., Potakhina, L., Tikhonenko, O.: Asymptotic analysis of queueing systems with finite buffer space. Commun. Comput. Inf. Sci. 431, 223–232 (2014)

    Article  Google Scholar 

  6. Tikhonenko, O.M.: An analog of littles formula for queueing systems with nonhomogeneous tasks. Autom. Remote Control 57(1), 85–88 (1996)

    MathSciNet  MATH  Google Scholar 

  7. Tikhonenko, O.M.: The problem of determination of the summarized messages volume in queueing systems and its applications. J. Inf. Process. Cybern. 32(7), 339–352 (1987)

    MathSciNet  MATH  Google Scholar 

  8. Tikhonenko, O.: Computer Systems Probability Analysis. Akademicka Oficyna Wydawnicza EXIT, Warsaw (2006). (in Polish)

    Google Scholar 

  9. Center for collective use of Karelian Research Centre of Russian Academy of Science. http://cluster.krc.karelia.ru/

  10. R Foundation for Statistical Computing, Vienna, Austria. ISBN 3-900051-07-0. http://www.R-project.org/

Download references

Acknowledgements

Research is supported by Russian Foundation for Basic Research, projects 15-07-02341, 15-07-02354, 15-07-02360 and the Program of Strategy Development of Petrozavodsk State University.

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Lyubov Potakhina .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2016 Springer International Publishing Switzerland

About this paper

Cite this paper

Morozov, E., Potakhina, L., Tikhonenko, O. (2016). Regenerative Analysis of a System with a Random Volume of Customers. In: Dudin, A., Gortsev, A., Nazarov, A., Yakupov, R. (eds) Information Technologies and Mathematical Modelling - Queueing Theory and Applications. ITMM 2016. Communications in Computer and Information Science, vol 638. Springer, Cham. https://doi.org/10.1007/978-3-319-44615-8_23

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-44615-8_23

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-44614-1

  • Online ISBN: 978-3-319-44615-8

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics