Skip to main content

On the estimation of moments of regenerative cycles in a general closed central-server queueing network

Part of the Lecture Notes in Mathematics book series (LNM,volume 1233)

Abstract

This paper deals with the regenerative property of closed central-server queueing networks with FCFS discipline and general service times and presents a method for estimation of their moments.

Keywords

  • Service Time
  • Regenerative Property
  • Regenerative Simulation
  • Queueing Network
  • Random Index

These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

This is a preview of subscription content, access via your institution.

Buying options

Chapter
USD   29.95
Price excludes VAT (Canada)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   34.99
Price excludes VAT (Canada)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   46.00
Price excludes VAT (Canada)
  • 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

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Sauer C.H., Chandy K.M. Computer systems performance modelling, Prentice-Hall, Inc., Englewood Cliffs, New Jersey, 1981.

    Google Scholar 

  2. Iglehart D.L., Shedler G.S. Regenerative simulation of response times in network of queues, Lecture Notes in Control and Information Sciences, Springer-Verlag, New-York, 1980, 26.

    MATH  Google Scholar 

  3. Kalashnikov V.V., Qualitative analysis of the behaviour of complex systems by a trial functions method (in Russian), Nauka, Moscow, 1978.

    Google Scholar 

  4. Szeidl L. On the estimation of moments of regenerative cycles in a closed Central-server queueing network (in Russian), Teorija Verojatn. i Primenen. (in print).

    Google Scholar 

  5. Feller W. An introduction to probability theory and its applications, John Wiley, New York, 1970.

    MATH  Google Scholar 

  6. Szeidl L. On the estimation of rate of convergence in the renewal theorem for a discrete irreversible case, (in Russian), Stability Problems for Stochastic Models. Proceedings of the Seminar, Moscow, The Institute for Systems Studies, 1985, 121–126.

    Google Scholar 

  7. Borovkov A.A. Probability theory (in Russian), Nauka, Moscow, 1978.

    MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and Permissions

Copyright information

© 1987 Springer-Verlag

About this paper

Cite this paper

Szeidl, L. (1987). On the estimation of moments of regenerative cycles in a general closed central-server queueing network. In: Kalashnikov, V.V., Penkov, B., Zolotarev, V.M. (eds) Stability Problems for Stochastic Models. Lecture Notes in Mathematics, vol 1233. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0072724

Download citation

  • DOI: https://doi.org/10.1007/BFb0072724

  • Received:

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-17204-8

  • Online ISBN: 978-3-540-47394-7

  • eBook Packages: Springer Book Archive