Skip to main content
Log in

Applying foster’s criteria to a GI / PH /1 queuing system

  • Published:
Cybernetics and Systems Analysis Aims and scope

Abstract

Foster’s criteria are used to obtain necessary and sufficient conditions ensuring the recurrence and ergodicity of an embedded Markov chain for a GI / PH / 1 queuing system.

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. S. Asmussen, Applied Probability and Queues, Wiley, Chichester (1987).

    MATH  Google Scholar 

  2. F. Foster, “On the stochastic matrices associated with certain queueing processes,” Ann. Math. Stat., 24, 355–360 (1953).

    MATH  MathSciNet  Google Scholar 

  3. G. Fayolle, V. A. Malyshev, and M. V. Menshikov, Topics in the Constructive Theory of Countable Markov Chains, Cambridge University Press, Cambridge (1995).

    MATH  Google Scholar 

  4. M. F. Neuts, Matrix-Geometric Solutions in Stochastic Models: an Algorithmic Approach, John Hopkins, Baltimore (1981).

    MATH  Google Scholar 

  5. H. M. Taylor and S. Karlin, A First Course in Stochastic Processes, Academ. Press, New York (1975).

    MATH  Google Scholar 

  6. H. R. Gail, S. L. Hantler, and B. A. Taylor, “Solutions of the basic matrix equation forM /G / 1 and G / M / 1 type Markov chains,” Stoch. Models, 10, No. 1, 1–43 (1994).

    MATH  MathSciNet  Google Scholar 

  7. H. R. Gail, S. L. Hantler, and B. A. Taylor, “Spectral analysis of M / G / 1 and G / M / 1 type Markov chains,” Adv. Appl. Probab., 28, 114–165 (1996).

    Article  MATH  MathSciNet  Google Scholar 

  8. H. R. Gail, S. L. Hantler, and B. A. Taylor, “Matrix-geometric invariant measures for G / M / 1 type Markov chains,” Stoch. Models, 14, No. 3, 537–569 (1998).

    MATH  MathSciNet  Google Scholar 

  9. G. Latouche and P. G. Taylor, “Drift conditions for matrix-analytic models,” Math. Oper. Res., 28, No. 2, 346–360 (2003).

    Article  MATH  MathSciNet  Google Scholar 

  10. A. N. Dudin and V. J. Klimenok, “Multi-dimensional quasi-Toeplitz Markov chains,” J. Appl. Math. Stoch. Anal., 12, No. 4, 393–415 (1998).

    MathSciNet  Google Scholar 

  11. M. D. Moustafa, “Input-output Markov processes,” Proc. Koninkl. Ned. Akad. Wetensch., A60, 112–118 (1957).

    MathSciNet  Google Scholar 

  12. S. P. Meyn and R. L. Tweedie, Markov Chains and Stochastic Stability, Springer-Verlag, Berlin (1993).

    MATH  Google Scholar 

  13. D. M. Lucantoni, “New results on the single server queue with a batch Markovian arrival process, ” Commun. in Stat.: Stoch. Models, 7, No. 1, 1–46 (1991).

    MATH  MathSciNet  Google Scholar 

  14. A. G. Pakes, “Some conditions for ergodicity and recurrence of Markov chains,” Oper. Res., 17, 1058–1061 (1969).

    Article  MATH  MathSciNet  Google Scholar 

  15. M. F. Neuts, “A versatile Markovian point process,” J. Appl. Probab., 16, 764–779 (1979).

    Article  MATH  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Additional information

__________

Translated from Kibernetika i Sistemnyi Analiz, No. 3, pp. 148–156, May–June 2006.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Baum, D., Breuer, L. Applying foster’s criteria to a GI / PH /1 queuing system. Cybern Syst Anal 42, 433–439 (2006). https://doi.org/10.1007/s10559-006-0081-8

Download citation

  • Received:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10559-006-0081-8

Keywords

Navigation