Kronecker representation and decompositional analysis of closed queueing networks with phase-type service distributions and arbitrary buffer sizes
Author
Dayar, T.
Meriç, A.
Date
2008Source Title
Annals of Operations Research
Print ISSN
0254-5330
Publisher
Springer New York LLC
Volume
164
Pages
193 - 210
Language
English
Type
ArticleItem Usage Stats
56
views
views
49
downloads
downloads
Metadata
Show full item recordAbstract
Two 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.
Keywords
Closed queueing networkFixed-point iteration
Kronecker representation
Multilevel method
Network decomposition
Phase-type service distribution