Skip to main content
Log in

Sufficient conditions for functional-limit-theorem versions ofL = λW

  • Published:
Queueing Systems Aims and scope Submit manuscript

Abstract

The familiar queueing principle expressed by the formulaL=λW can be interpreted as a relation among strong laws of large numbers. In a previous paper, we showed that this principle can be extended to include relations among other classical limit theorems such as central limit theorems and laws of the iterated logarithm. Here we provide sufficient conditions for these limit theorems using regenerative structure.

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

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Similar content being viewed by others

References

  1. K.B. Athreya and P. Ney, A new approach to the limit theory of recurrent Markov chains, Trans. Amer. Math. Soc. 245(1978)493.

    Google Scholar 

  2. P. Billingsley,Convergence of Probability Measures (Wiley, New York, 1968).

    Google Scholar 

  3. F. Charlot, M.A. Ghidouche and M. Hamimi, Irreducibility and recurrence in the sense of Harris for the waiting times in the GI/G/q queue, Z. Wahrscheinlichkeitsth. 43(1978)187, (in French).

    Google Scholar 

  4. M.A. Crane and D.L. Iglehart, Simulating stable stochastic systems, I: General multi-server queues, J. Assoc. Comp. Mach. 21(1974)103.

    Google Scholar 

  5. P.W. Glynn, Some new results in regenerative process theory, Technical Report No. 60, Department of Operations Research, Stanford University (1982).

  6. P.W. Glynn and W. Whitt, A central-limit-theorem version ofL=λW, Queueing Systems: Theory and Applications 1(1986)191.

    Google Scholar 

  7. P.W. Glynn and W. Whitt, An LIL version ofL=λW, submitted for publication (1985).

  8. D.L. Iglehart, Functional limit theorems for the queue GI/G/1 in light traffic, Adv. Appl. Prob. 3(1971)269.

    Google Scholar 

  9. D.L. Iglehart, Simulating stable stochastic systems, V: Comparison of ratio estimators, Nav. Res. Log. Qtrly. 22(1975)553.

    Google Scholar 

  10. E. Nummelin, A splitting technique for Harris recurrent Markov chains, Z. Wahrscheinlichkeitsth. 43(1978)309.

    Google Scholar 

  11. E. Nummelin,General Irreducible Markov Chains and Nonnegative Operators (Cambridge University Press, Cambridge, England, 1984).

    Google Scholar 

  12. W. Philipp, Almost sure invariance principles for sums ofB-valued random variables, in:Probability in Banach Spaces II, Lecture Notes in Mathematics 709 (Springer-Verlag, New-York, 1979) p. 171.

    Google Scholar 

  13. R.F. Serfozo, Functional limit theorems for stochastic processes based on embedded processes, Adv. Appl. Prob. 7(1975)123.

    Google Scholar 

  14. K. Sigman, A new look at the FIFO GI/G/c queue by use of the random assignment discipline, Department of Operations Research, University of California at Berkeley (1986).

  15. S. Stidham, Jr., A last word onL=λW, Oper. Res. 22(1974)417.

    Google Scholar 

  16. V. Strassen, An invariance principle for the law of the iterated logarithm, Z.Wahrscheinlichkeitsth. 3(1964)211.

    Google Scholar 

  17. W. Whitt, Weak convergence of probability measures on the function spaceC[0, ∞), Ann. Math. Statist. 41(1970)939.

    Google Scholar 

  18. W. Whitt, Embedded renewal processes in the GI/G/s queue, J. Appl. Prob. 9(1972)650.

    Google Scholar 

  19. W. Whitt, Some useful functions for functional limit theorems, Math. Oper. Res. 5(1980)67.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Additional information

Supported by the National Science Foundation under Grant No. ECS-8404809 and by the U.S. Army under Contract No. DAAG29-80-C-0041.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Glynn, P.W., Whitt, W. Sufficient conditions for functional-limit-theorem versions ofL = λW . Queueing Syst 1, 279–287 (1987). https://doi.org/10.1007/BF01149539

Download citation

  • Received:

  • Revised:

  • Issue Date:

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

Keywords

Navigation