Skip to main content
SpringerLink
Log in

The method of renovating events and its applications in queueing theory

  • Chapter
Semi-Markov Models

Abstract

The purpose of this talk is to present main results (some of them are unpublished) obtained in queueing theory by so called method of renovating events. This method was developed by A.A. Borovkov in 1978 and was published in his book “Asymptotic Methods in Queueing Theory”, 1980 — in Russian, 1984 — in English.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 129.00
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 169.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info
Hardcover Book
USD 169.99
Price excludes VAT (USA)
  • Durable hardcover 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

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  • Achmarov, I. (1981). The rate of convergence in ergodicity and continuity theorems for systems with an infinite number of servers. Sibirsk.Mat.Zh., 21, 16–21 (in Russian).

    Google Scholar 

  • Borovkov, A.A. (1984). Asymptotic methods in queueing theory. Wiley, New York. Translated from Russian, Izdat.Nauka, Moscow (1980).

    MATH  Google Scholar 

  • Borovkov, A.A. (1984). A note on the rate of convergence in stability theorems. Teor.Verojat. i Primemen., 29, 119–120 (in Russian).

    MathSciNet  MATH  Google Scholar 

  • Foss, S.G. (1983). On conditions of ergodicity for many-server queues. Sibirsk.Mat.Zh., 24, 168–175 (in Russian).

    MathSciNet  MATH  Google Scholar 

  • Kalashnikov, V.V. (1979). Estimates of stability for renovative processes. Izv.Acad.Nauk.USSR, Tech.Kybernetika, 5, 85–89 (in Russian).

    MathSciNet  Google Scholar 

  • Kalashnikov, V.V. and S.A. Anichkin (1981). Continuity of random sequences and approximation of Markov chains. Adv.Appl.Prob., 2, 402–414.

    Article  MathSciNet  Google Scholar 

  • Lisek, B. (1982). A method for solving a class of recursive stochastic equations. Z.Wahrscheinlichkeitstheorie verw.Geb., 60, 151–162.

    Article  MathSciNet  MATH  Google Scholar 

  • Whitt, W. (1982). Existence of limiting distributions in the GI/G/s queue. Math.Oper.Res., 7, 88–94.

    Article  MathSciNet  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Novosibirsk State University, 630090, Novosibirsk, USSR

    S. G. Foss

Authors
  1. S. G. Foss
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Free University of Brussels, Brussels, Belgium

    Jacques Janssen

Rights and permissions

Reprints and permissions

Copyright information

© 1986 Springer Science+Business Media New York

About this chapter

Cite this chapter

Foss, S.G. (1986). The method of renovating events and its applications in queueing theory. In: Janssen, J. (eds) Semi-Markov Models. Springer, Boston, MA. https://doi.org/10.1007/978-1-4899-0574-1_18

Download citation

  • DOI: https://doi.org/10.1007/978-1-4899-0574-1_18

  • Publisher Name: Springer, Boston, MA

  • Print ISBN: 978-1-4899-0576-5

  • Online ISBN: 978-1-4899-0574-1

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation