Kronecker representation and decompositional analysis of closed queueing networks with phase-type service distributions and arbitrary buffer sizes
Date
2008
Authors
Dayar, T.
Meriç, A.
Editor(s)
Advisor
Supervisor
Co-Advisor
Co-Supervisor
Instructor
BUIR Usage Stats
2
views
views
16
downloads
downloads
Citation Stats
Series
Abstract
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.
Source Title
Annals of Operations Research
Publisher
Springer New York LLC
Course
Other identifiers
Book Title
Keywords
Closed queueing network, Fixed-point iteration, Kronecker representation, Multilevel method, Network decomposition, Phase-type service distribution
Degree Discipline
Degree Level
Degree Name
Citation
Permalink
Published Version (Please cite this version)
Language
English