Persistent Link:
http://hdl.handle.net/10150/185131
Title:
Analysis of queueing systems requiring resequencing of customers.
Author:
Chowdhury, Shyamal
Issue Date:
1990
Publisher:
The University of Arizona.
Rights:
Copyright © is held by the author. Digital access to this material is made possible by the University Libraries, University of Arizona. Further transmission, reproduction or presentation (such as public display or performance) of protected items is prohibited except with permission of the author.
Abstract:
This dissertation describes queueing-theoretic analysis of shared service systems that require that customers leave the system in the sequence in which they arrived. This requirement makes it necessary to resequence customers before they leave the system. Resequencing adds new complications to the analysis of queueing systems. While waiting time is still important, resequencing results in a new type of "non-working" delay of a customer called the resequencing delay. This dissertation presents primarily analytical and numerical methods to determine the distribution and mean value of resequencing delay, and of total delay. In the simplest models closed form analytical expressions have been obtained, but in more complex models numerical methods have been developed to compute the distribution and mean of resequencing delay, and of total delay. This enables us to study the behavior of resequencing and total delay as system parameters are changed. For several composite server models we present expressions for the distribution and mean of resequencing delay, and of total delay. In particular we consider the M/M/∞ composite server model, the M/H(K)/∞ composite server model, the G/M/∞ composite server model, the M/M/m composite server model, and the G/M/m composite server model. The formulas are interpreted using asymptotic approximation or bounding techniques. For more general composite server models, it is difficult to obtain closed form expressions for resequencing and total delay. We develop numerical methods based on matrix-geometric methods to compute resequencing and total delay. In particular, we develop numerical methods for the computation of the mean resequencing delay, and mean total delay for the M/H₂/m composite server model, and the M/Hypo₂/m composite server model.
Type:
text; Dissertation-Reproduction (electronic)
Keywords:
Mathematics; Operations Research; Computer Science; Queuing theory; Computer networks.
Degree Name:
Ph.D.
Degree Level:
doctoral
Degree Program:
Computer Sciences; Graduate College
Degree Grantor:
University of Arizona
Advisor:
Downey, Peter J.

Full metadata record

DC FieldValue Language
dc.language.isoenen_US
dc.titleAnalysis of queueing systems requiring resequencing of customers.en_US
dc.creatorChowdhury, Shyamalen_US
dc.contributor.authorChowdhury, Shyamalen_US
dc.date.issued1990en_US
dc.publisherThe University of Arizona.en_US
dc.rightsCopyright © is held by the author. Digital access to this material is made possible by the University Libraries, University of Arizona. Further transmission, reproduction or presentation (such as public display or performance) of protected items is prohibited except with permission of the author.en_US
dc.description.abstractThis dissertation describes queueing-theoretic analysis of shared service systems that require that customers leave the system in the sequence in which they arrived. This requirement makes it necessary to resequence customers before they leave the system. Resequencing adds new complications to the analysis of queueing systems. While waiting time is still important, resequencing results in a new type of "non-working" delay of a customer called the resequencing delay. This dissertation presents primarily analytical and numerical methods to determine the distribution and mean value of resequencing delay, and of total delay. In the simplest models closed form analytical expressions have been obtained, but in more complex models numerical methods have been developed to compute the distribution and mean of resequencing delay, and of total delay. This enables us to study the behavior of resequencing and total delay as system parameters are changed. For several composite server models we present expressions for the distribution and mean of resequencing delay, and of total delay. In particular we consider the M/M/∞ composite server model, the M/H(K)/∞ composite server model, the G/M/∞ composite server model, the M/M/m composite server model, and the G/M/m composite server model. The formulas are interpreted using asymptotic approximation or bounding techniques. For more general composite server models, it is difficult to obtain closed form expressions for resequencing and total delay. We develop numerical methods based on matrix-geometric methods to compute resequencing and total delay. In particular, we develop numerical methods for the computation of the mean resequencing delay, and mean total delay for the M/H₂/m composite server model, and the M/Hypo₂/m composite server model.en_US
dc.typetexten_US
dc.typeDissertation-Reproduction (electronic)en_US
dc.subjectMathematicsen_US
dc.subjectOperations Researchen_US
dc.subjectComputer Scienceen_US
dc.subjectQueuing theoryen_US
dc.subjectComputer networks.en_US
thesis.degree.namePh.D.en_US
thesis.degree.leveldoctoralen_US
thesis.degree.disciplineComputer Sciencesen_US
thesis.degree.disciplineGraduate Collegeen_US
thesis.degree.grantorUniversity of Arizonaen_US
dc.contributor.advisorDowney, Peter J.en_US
dc.contributor.committeememberAndrews, Gregory R.en_US
dc.contributor.committeememberMyers, Eugene W.en_US
dc.contributor.committeememberHigle, Julia L.en_US
dc.identifier.proquest9100549en_US
dc.identifier.oclc704721479en_US
All Items in UA Campus Repository are protected by copyright, with all rights reserved, unless otherwise indicated.