Triangular M/G/1-Type and Tree-Like Quasi-Birth-Death Markov Chains

References

• Adan I. J. B. F., van der Wal J. Combining make to order and make to stock. OR Spectrum (1998) 20(2):73–81Crossref, Google Scholar
• Adan I. J. B. F., Weiss G. Analysis of a simple Markovian re-entrant line with infinite supply of work under the LBFS policy. Queueing Systems (2006) 54(3):169–183Crossref, Google Scholar
• Bini D. A., Latouche G., Meini B. Solving nonlinear matrix equations arising in tree-like stochastic processes. Linear Algebra Its Appl. (2003) 366(1):39–64Crossref, Google Scholar
• Bini D. A., Latouche G., Meini B.Numerical Methods for Structured Markov Chains (2005) (Oxford University Press, New York) Crossref, Google Scholar
• Bini D. A., Meini B., Steffé S., Van Houdt B. Structured Markov chains solver: Algorithms. Proc. 2006 Workshop Tools Solving Structured Markov Chains (2006a) 201(ACM Press, New York) ACM Internationl Conference Proceeding SeriesArticle 13Crossref, Google Scholar
• Bini D. A., Meini B., Steffé S., Van Houdt B. Structured Markov chains solver: Software tools. Proc. 2006 Workshop Tools Solving Structured Markov Chains (2006b) 201(ACM Press, New York) ACM Internationl Conference Proceeding SeriesArticle 14Crossref, Google Scholar
• Cohen J. W. A two-queue, one-server model with priority for the longer queue. Queueing Systems (1987) 2(3):261–283Crossref, Google Scholar
• De Bruijn N. G.Asymptotic Methods in Analysis (1981) 3rd ed.(Dover Publications, New York) Google Scholar
• Flatto L. The longer queue model. Probab. Engrg. Inform. Sci. (1989) 3:537–559Crossref, Google Scholar
• Grassmann W. K. The use of eigenvalues for finding equilibrium probabilities of certain Markovian two-dimensional queueing problems. INFORMS J. Comput. (1993) 15(4):412–421Link, Google Scholar
• Grassmann W. K. Finding equilibrium probabilities of QBD processes by spectral methods when eigenvalues vanish. Linear Algebra Its Appl. (1994) 386:207–223Crossref, Google Scholar
• He Q.-M. Classification of Markov process of M/G/1 type with a tree structure and its applications to queueing models. Oper. Res. Lett. (2000) 26(2):67–80Crossref, Google Scholar
• Jaiswal N. K.Priority Queues (1968) 50(Academic Press, New York) Mathematics in Science and Engineering SeriesGoogle Scholar
• Latouche G., Ramaswami V.Introduction to Matrix Analytic Methods in Stochastic Modeling (1999) (ASA–SIAM, Philadelphia) Crossref, Google Scholar
• Liu D., Zhao Y., Chakravarthy S. R., Alfa A. S. Determination of an explicit solution for a general class of Markov processes. Matrix-Analytic Methods in Stochastic Models (1996) 183(Marcel Dekker, New York) 343–357Lecture Notes in Pure and Applied MathematicsCrossref, Google Scholar
• Neuts M. F.Matrix-Geometric Solutions in Stochastic Models: An Algorithmic Approach (1981) (Johns Hopkins University Press, Baltimore) Google Scholar
• Neuts M. F.Structured Stochastic Matrices of M/G/1 Type and Their Applications (1989) (Marcel Dekker, New York) Google Scholar
• Pitman J., Aldous D., Propp J. Enumerations of trees and forests related to branching processes and random walks. Microsurveys in Discrete Probability (1998) 41(American Mathematical Society, Providence, RI) 163–180DIMACS Series in Discrete Mathematics and Theoretical Computer ScienceCrossref, Google Scholar
• Riska A., Smirni E., Field T., Harrison P. G., Bardley J., Harder U. MAMSolver: A matrix analytic methods tool. Computer Performance Evaluation: Modelling Techniques and Tools (2002) 2324(Springer-Verlag)205–211Lecture Notes in Computer ScienceCrossref, Google Scholar
• Takács L. A generalization of the ballot problem and its application in the theory of queues. J. Amer. Statist. Assoc. (1962) 57(298):327–337Crossref, Google Scholar
• Takine T., Sengupta B., Yeung R. W. A generalization of the matrix M/G/1 paradigm for Markov chains with a tree structure. Stochastic Models (1995) 11(3):411–421Crossref, Google Scholar
• van Leeuwaarden J. S. H., Winands E. M. M. Quasi-birth-and-death processes with an explicit rate matrix. Stochastic Models (2006) 22(1):77–98Crossref, Google Scholar
• van Leeuwaarden J. S. H., Squillante M. S., Winands E. M. M. Quasi-birth-and-death processes, lattice path counting, and hypergeometric functions. J. Appl. Probab. (2009) 46(2):507–520Crossref, Google Scholar
• Van Velthoven J., Van Houdt B., Blondia C. The impact of buffer finiteness on the loss rate in a priority queueing system. Formal Methods and Stochastic Models for Performance Evaluation, EPEW 2006 (2006a) 4054(Springer, Berlin) 211–225Lecture Notes in Computer ScienceCrossref, Google Scholar
• Van Velthoven J., Van Houdt B., Blondia C. Transient analysis of tree-like processes and its application to random access systems. ACM SIGMETRICS Performance Eval. Rev. (2006b) 34(1):181–190Crossref, Google Scholar
• Yeung R. W., Alfa A. S. The quasi-birth-death type Markov chain with a tree structure. Stochastic Models (1999) 15(4):639–659Crossref, Google Scholar
• Yeung R. W., Sengupta B. Matrix product-form solutions for Markov chains with a tree structure. Adv. Appl. Probab. (1994) 26(4):965–987Crossref, Google Scholar
• Zhang Z. G., Tian N. An analysis of queueing systems with multi-task servers. Eur. J. Oper. Res. (2004) 156(2):375–389Crossref, Google Scholar