Skip to main content

Part of the book series: Mathematics and Its Applications ((MAIA,volume 271))

  • 517 Accesses

Abstract

Many deep results in probability theory oblige the consideration of sequences of i.i.d.r.v.’s. This is true for applications too. We have already seen that recurrent flows (see Chapter 3) are constructed by virtue of a sequence of i.i.d. interarrival times. In Chapter 4, we discovered that the beginnings of successive busy periods for the GI|GI|1|∞ model can be treated as a recurrent flow too. The collection of similar examples can be enlarged.

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 84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 109.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info
Hardcover Book
USD 109.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.

Comments

  • Smith, W. (1958) Renewal theory and its ramifications. J. Roy. Stat. Soc., B 20, 243–302.

    MATH  Google Scholar 

  • Cox, D. (1962) Renewal Theory. Methuen, London.

    MATH  Google Scholar 

  • Feller, W. (1971) An Introduction to Probability Theory and Its Applications, Vol. 2, Second Edition. J. Wiley and Sons, New York.

    MATH  Google Scholar 

  • Disney, R., and Kiessler, P. (1987) Traffic Processes in Queueing Networks. The Johns Hopkins Univ. Press, Baltimore and London.

    Google Scholar 

  • Lorden, G. (1970) On excess over the boundary. The Annals of Math. Stat., 41, 520–527.

    Article  MathSciNet  MATH  Google Scholar 

  • Carlsson, H., and Nerman, O. (1986) An alternative proof of Lorden’s renewal inequality. Adv. Appl. Prob., 18, 1015–1016.

    Article  MathSciNet  MATH  Google Scholar 

  • Kalashnikov, V. (1977) An uniform estimate of the rate of convergence in the discrete time renewal theorem. Prob. Theory Appl., 22, No. 2, 399–403.

    MathSciNet  Google Scholar 

  • Kalashnikov, V. (1978) Qualitative Analysis of the Behaviour of Complex Systems by the Method of Test Functions. Nauka, Moscow (in Russian).

    Google Scholar 

  • Lindvall, T. (1977) A probabilistic proof of Blackwell’s renewal theorem. The Annals of Probabil., 5, No. 2, 482–485.

    Article  MathSciNet  MATH  Google Scholar 

  • Lindvall, T. (1979) On coupling of discrete renewal processes. Z. Wahrscheinlichkeitstheorie verw. Geb., B 48, H. 1, 57–70.

    Article  MathSciNet  Google Scholar 

  • Lindvall, T. (1982) On coupling of continuous time renewal processes. J. Appl. Probabil., 19, No. 1, 82–89.

    Article  MathSciNet  MATH  Google Scholar 

  • Lindvall, T. (1986) On coupling of renewal processes with use of failure rates. Stoch. Proc. Appl., 22, 1–15.

    Article  MathSciNet  MATH  Google Scholar 

  • Thorisson, H. (1983) The coupling of regenerative processes. Adv. Appl. Probability, 15, 531–561.

    Article  MathSciNet  MATH  Google Scholar 

  • Asmussen, S. (1987) Applied Probability and Queues. J. Wiley and Sons, Chichester.

    Google Scholar 

  • Lindvall, T. (1992) Lectures on the Coupling Method. J. Wiley and Sons, Chichester.

    Google Scholar 

  • Thorisson, H. (1983) The coupling of regenerative processes. Adv. Appl. Probability, 15, 531–561.

    Article  MathSciNet  MATH  Google Scholar 

  • Kalashnikov, V. (1977) An uniform estimate of the rate of convergence in the discrete time renewal theorem. Prob. Theory Appl., 22, No. 2, 399–403.

    MathSciNet  Google Scholar 

  • Kalashnikov, V. (1980) Stability estimates for renovative processes. Engineering Cybernetics, 1979, 17, 85–89.

    Google Scholar 

  • Sil’vestrov, D. (1983/84) Method of the common probability space in ergodic theorems for regenerative processes. Math. Operationsforshnung and Statistics. Ser. Optimization,14, No. 2; 15, No. 4.

    Google Scholar 

  • Feller, W. (1971) An Introduction to Probability Theory and Its Applications, Vol. 2, Second Edition. J. Wiley and Sons, New York.

    MATH  Google Scholar 

  • Asmussen, S. (1987) Applied Probability and Queues. J. Wiley and Sons, Chichester.

    Google Scholar 

  • Lindvall, T. (1977) A probabilistic proof of Blackwell’s renewal theorem. The Annals of Probabil., 5, No. 2, 482–485.

    Article  MathSciNet  MATH  Google Scholar 

  • Lindvall, T. (1992) Lectures on the Coupling Method. J. Wiley and Sons, Chichester.

    Google Scholar 

  • Thorisson, H. (1987) A complete coupling proof of Blackwell’s renewal theorem. Stoc. Proc. Appl., 26, 87–97.

    Article  MathSciNet  MATH  Google Scholar 

  • Asmussen, S. (1992) On coupling and weak convergence to stationarity. Ann. Appl. Prob., 2, 739–751.

    Article  MathSciNet  MATH  Google Scholar 

  • Kalashnikov, V. (1977) An uniform estimate of the rate of convergence in the discrete time renewal theorem. Prob. Theory Appl., 22, No. 2, 399–403.

    MathSciNet  Google Scholar 

  • Kalashnikov, V. (1980) Stability estimates for renovative processes. Engineering Cybernetics, 1979, 17, 85–89.

    Google Scholar 

  • Anichkin, S. (1988) Rate of convergence estimates in Blackwell’s theorem. J. Soy. Mathematics, 40, No. 4, 449–453.

    Article  MathSciNet  MATH  Google Scholar 

  • Iglehart, D., and Shedler, G. (1980) Regenerative simulation of responce times in networks of queues. LN in Control and Information Sci., 26, Springer-Verlag, Berlin.

    Google Scholar 

  • Lindvall, T. (1986) On coupling of renewal processes with use of failure rates. Stoch. Proc. Appl., 22, 1–15.

    Article  MathSciNet  MATH  Google Scholar 

  • Thorisson, H. (1992) Construction of a stationary regenerative process. Stoc. Proc. Appl., 42, 237–253.

    Article  MathSciNet  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Rights and permissions

Reprints and permissions

Copyright information

© 1994 Springer Science+Business Media Dordrecht

About this chapter

Cite this chapter

Kalashnikov, V.V. (1994). Renewal Processes. In: Mathematical Methods in Queuing Theory. Mathematics and Its Applications, vol 271. Springer, Dordrecht. https://doi.org/10.1007/978-94-017-2197-4_6

Download citation

  • DOI: https://doi.org/10.1007/978-94-017-2197-4_6

  • Publisher Name: Springer, Dordrecht

  • Print ISBN: 978-90-481-4339-9

  • Online ISBN: 978-94-017-2197-4

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics