A comparative analysis of the successive lumping and the lattice path counting algorithms. (March 2016)

• Record Type: Journal Article
• Authors: Katehakis, Michael N.; Smit, Laurens C.; Spieksma, Floske M.
• Is Part Of: Journal of applied probability. Volume 53:Number 1(2016)
• Page Start: 106
• Page End: 120
• Publication Date: 2016-03
• Subjects: Steady state analysis, -- queueing, -- successive lumping; Primary 60K25, -- Secondary 68M20; 519.2
• DOI: 10.1017/jpr.2015.12
• Languages: English
• ISSNs: 0021-9002

Abstract

Abstract: This paper provides a comparison of the successive lumping (SL) methodology developed in Katehakis et al. (2015) with the popular lattice path counting (Mohanty (1979)) in obtaining rate matrices for queueing models, satisfying the specific quasi birth and death structure as in Van Leeuwaarden et al. (2009) and Van Leeuwaarden and Winands (2006). The two methodologies are compared both in terms of applicability requirements and numerical complexity by analyzing their performance for the same classical queueing models considered in Van Leeuwaarden et al. (2009). The main findings are threefold. First, when both methods are applicable, the SL-based algorithms outperform the lattice path counting algorithm (LPCA). Second, there are important classes of problems (for example, models with (level) nonhomogenous rates or with finite state spaces) for which the SL methodology is applicable and for which the LPCA cannot be used. Third, another main advantage of SL algorithms over lattice path counting is that the former includes a method to compute the steady state distribution using this rate matrix.