Dayar, T.Meriç, A.2016-02-082016-02-0820080254-5330http://hdl.handle.net/11693/22974Two approximative fixed-point iterative methods based on decomposition for closed queueing networks with Coxian service distributions and arbitrary buffer sizes are extended to include phase-type service distributions. The irreducible Markov chain associated with each subnetwork in the respective decompositions is represented hierarchically using Kronecker products. The two methods are implemented in a software tool capable of computing the steady-state probability vector of each subnetwork by a multilevel method at each fixed-point iteration and are compared with other methods for accuracy and efficiency. Numerical results indicate that there is a niche filled by the two approximative methods.EnglishClosed queueing networkFixed-point iterationKronecker representationMultilevel methodNetwork decompositionPhase-type service distributionArticle10.1007/s10479-008-0429-8