Show simple item record

dc.contributor.advisorDayar, Tuğrul
dc.contributor.authorMeriç, Akın
dc.date.accessioned2016-01-08T18:01:39Z
dc.date.available2016-01-08T18:01:39Z
dc.date.issued2007
dc.identifier.urihttp://hdl.handle.net/11693/14538
dc.descriptionAnkara : The Department of Computer Engineering and the Institute of Engineering and Science of Bilkent University, 2007.en_US
dc.descriptionThesis (Master's) -- Bilkent University, 2007.en_US
dc.descriptionIncludes bibliographical references leaves 117-121en_US
dc.description.abstractThis thesis extends two approximative fixed–point iterative methods based on decomposition for closed queueing networks (QNs) with Coxian service distributions and arbitrary buffer sizes from the literature to include phase–type service distributions. It shows how the irreducible Markov chain associated with each subnetwork in the decomposition can be represented hierarchically using Kronecker products. The proposed methods are implemented in a software tool, which is capable of computing the steady–state probability vector of each subnetwork by a multilevel method at each fixed–point iteration. The two methods are compared with others, one being the multilevel method for the closed QN itself, for accuracy and efficiency on a number of examples using the tool, and their convergence properties are discussed. Numerical results indicate that there is a niche among the problems considered which is filled by the two approximative fixed–point iterative methods.en_US
dc.description.statementofresponsibilityMeriç, Akınen_US
dc.format.extentxvi, 126 leaves, tablesen_US
dc.language.isoEnglishen_US
dc.rightsinfo:eu-repo/semantics/openAccessen_US
dc.subjectClosed queueing networksen_US
dc.subjectPhase–type service distributionsen_US
dc.subjectKronecker representationsen_US
dc.subjectNetwork decompositionen_US
dc.subjectFixed–point iterationen_US
dc.subjectMultilevel methodsen_US
dc.subject.lccT57.9 .M48 2007en_US
dc.subject.lcshQueueing theory.en_US
dc.titleKronecker representation and decompositional analysis of closed queueing networks with phase-type service distributions and arbitrary buffer sizesen_US
dc.typeThesisen_US
dc.departmentDepartment of Computer Engineeringen_US
dc.publisherBilkent Universityen_US
dc.description.degreeM.S.en_US
dc.identifier.itemidBILKUTUPB085431


Files in this item

Thumbnail

This item appears in the following Collection(s)

Show simple item record