Markov Processes on a Semi-Infinite Strip and the Geometric Tail Algorithm

H.C. Tijms () and Daniel van Vuuren

Annals of Operations Research, 2002, vol. 113, issue 1, 133-140

Abstract: Many queuing processes have a semi-infinite strip in the two-dimensional plane as state space. As an alternative to well-established algorithms for the computation of steady-state probabilities, such as the matrix-geometric method and the spectral method, this article discusses a simple and easy-to-implement algorithm which is based on the geometric tail behavior of the steady-state probabilities. Some numerical comparisons between this algorithm and the spectral method are presented. Copyright Kluwer Academic Publishers 2002

Date: 2002
References: Add references at CitEc
Citations: View citations in EconPapers (1)

Downloads: (external link)
http://hdl.handle.net/10.1023/A:1020909928743 (text/html)
Access to full text is restricted to subscribers.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:annopr:v:113:y:2002:i:1:p:133-140:10.1023/a:1020909928743

Ordering information: This journal article can be ordered from
http://www.springer.com/journal/10479

DOI: 10.1023/A:1020909928743

Access Statistics for this article

Annals of Operations Research is currently edited by Endre Boros

More articles in Annals of Operations Research from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().