Hostname: page-component-cd9895bd7-dzt6s Total loading time: 0 Render date: 2024-12-23T11:04:51.286Z Has data issue: false hasContentIssue false
  • English
  • Français

A probabilistic algorithm for finding the rate matrix of a block-GI/M/1 Markov chain

Published online by Cambridge University Press:  17 February 2009

Emma Hunt
Emma Hunt
Affiliation:
Intelligence, Surveillance & Reconnaissance Division, DSTO Edinburgh, PO Box 1500, Edinburgh SA 5111, Australia; e-mail: [email protected]. School of Applied Mathematics, The University of Adelaide, Adelaide SA 5005, Australia; e-mail: [email protected].
Rights & Permissions [Opens in a new window]

Abstract

Core share and HTML view are not available for this content. However, as you have access to this content, a full PDF is available via the ‘Save PDF’ action button.

An efficient probabilistic algorithm is presented for the determination of the rate matrix of a block-GI/M/1 Markov chain. Recurrence of the chain is not assumed.

Type
Research Article
Information
The ANZIAM Journal , Volume 45 , Issue 4 , April 2004 , pp. 457 - 475
Copyright
Copyright © Australian Mathematical Society 2004

References

[1]Akar, N., Oğuz, N. C. and Sohraby, K., “TELPACK: An advanced TELetraffic analysis PACKage”, IEEE Infocom'97, http://www.cstp.umkc.edu/persona1/akar/home.html.Google Scholar
[2]Akar, N., Oğuz, N. C. and Sohraby, K., “An overview of TELPACK”, IEEE Commun. Mag. 36 (1998) 84–87.CrossRefGoogle Scholar
[3]Akar, N., Oğuz, N. C. and Sohraby, K., “A novel computational method for solving finite QBD processes”, Comm. Statist. Stochastic Models 16 (2000) 273–311.Google Scholar
[4]Akar, N. and Sohraby, K., “On computational aspects of the invariant subspace approach to teletraffic problems and comparisons”, preprint.Google Scholar
[5]Akar, N. and Sohraby, K., “An invariant subspace approach in M/G/1 and G/M/1 type Markov chains”, Comm. Statist. Stochastic Models 13 (1997) 381–416.Google Scholar
[6]Asmussen, S. and Ramaswami, V., “Probabilistic interpretations of some duality results for the matrix paradigms in queueing theory”, Comm. Statist. Stochastic Models 6 (1990) 715–733.Google Scholar
[7]Bini, D. and Meini, B., “On cyclic reduction applied to a class of Toeplitz-like matrices arising in queueing problems”, in Proc. 2nd Intern. Workshop on Numerical Solution of Markov Chains, (Raleigh, North Carolina, 1995) 21–38.Google Scholar
[8]Bini, D. and Meini, B., “Improved cyclic reduction for solving queueing problems”, Numer. Algorithms 15 (1997) 57–74.CrossRefGoogle Scholar
[9]Bini, D. A., Latouche, G. and Meini, B., “Quadratically convergent algorithms for solving matrix polynomial equations”, Technical Report 424, Université Libre Bruxelles, 2000.Google Scholar
[10]Golub, G. H. and Van Loan, C. F., Matrix computations (Johns Hopkins University Press, Baltimore, 1989).Google Scholar
[11]Hunt, E., “A probabilistic algorithm for determining the fundamental matrix of a block M/G/1 Markov chain”, Math. Comput. Modelling 38 (2003) 1203–1209.Google Scholar
[12]Latouche, G. and Ramaswami, V., “A logarithmic reduction algorithm for Quasi-Birth-Death processes”, J. Appl. Probab. 30 (1993) 650–674.Google Scholar
[13]Latouche, G. and Taylor, P., Matrix-analytic methods (World Scientific, Singapore, 2002).Google Scholar
[14]Laub, A. J., “A Schur method for solving algebraic Riccati equations”, IEEE Trans. Auto. Control 24 (1979) 913–925.CrossRefGoogle Scholar
[15]Meini, B., “Solving QBD problems: the cyclic reduction algorithm versus the invariant subspace method”, Adv. Perf. Anal. 1 (1998) 215–225.Google Scholar
[16]Neuts, M. F., Matrix geometric solutions in stochastic models (Johns Hopkins University Press, Baltimore, 1981).Google Scholar
[17]Ramaswami, V., “A duality theorem for the matrix paradigms in queueing theory”, Comm. Statist. Stochastic Models 6 (1990) 151–161.Google Scholar