Show simple item record

dc.contributor.authorDayar, T.en_US
dc.contributor.authorMeriç, A.en_US
dc.date.accessioned2016-02-08T10:07:15Z
dc.date.available2016-02-08T10:07:15Z
dc.date.issued2008en_US
dc.identifier.issn0254-5330
dc.identifier.urihttp://hdl.handle.net/11693/22974
dc.description.abstractTwo 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.en_US
dc.language.isoEnglishen_US
dc.source.titleAnnals of Operations Researchen_US
dc.relation.isversionofhttp://dx.doi.org/10.1007/s10479-008-0429-8en_US
dc.subjectClosed queueing networken_US
dc.subjectFixed-point iterationen_US
dc.subjectKronecker representationen_US
dc.subjectMultilevel methoden_US
dc.subjectNetwork decompositionen_US
dc.subjectPhase-type service distributionen_US
dc.titleKronecker representation and decompositional analysis of closed queueing networks with phase-type service distributions and arbitrary buffer sizesen_US
dc.typeArticleen_US
dc.departmentDepartment of Computer Engineering
dc.citation.spage193en_US
dc.citation.epage210en_US
dc.citation.volumeNumber164en_US
dc.identifier.doi10.1007/s10479-008-0429-8en_US
dc.publisherSpringer New York LLCen_US


Files in this item

Thumbnail

This item appears in the following Collection(s)

Show simple item record