The Ph(t)/Ph(t)/s/c Queueing Model and Approximation

Time-dependent queueing models are important since most of real-life problems are time-dependent. We develop a numerical approximation algorithm for the mean, variance and higher-order moments of the number of entities in the system at time t for the Ph(t)/Ph(t)/s/c queueing model. This model can be thought as a reparameterization to the G(t)/GI(t)/s. Our approach is to partition the state space into known and identifiable structures, such as the M(t)/M(t)/s/c or M(t)/M(t)/1 queueing models. We then use the Polya-Eggenberger distribution to approximate certain unknown probabilities via a two-moment matching algorithm. We describe the necessary steps to validate the approximation and measure the accuracy of the model.

Name thesis:degree_name

Master of Science

Level thesis:degree_level

masters

Discipline thesis:degree_discipline

Industrial and Systems Engineering

Department dc:contributor.department

Industrial and Systems Engineering

Grantor dc:publisher

Virginia Tech

Year dc:date.issued

2003

Author dc:creator

• Rueda, Javier Eduardo

Chair dc:contributor.committeechair

• Taaffe, Michael R.

Committee members dc:contributor.committeemember

• Castagliola, Philippe
• Lin, Kyle Y.

• Polya-Eggenberger
• Queueing
• phase-type
• stochastic
• time-dependent queues

Statement dc:rights

• In Copyright

Licence dc:rights.uri

• http://rightsstatements.org/vocab/InC/1.0/

Dc Identifier Other

etd-12092003-164431

OAI identifier oai:identifier

oai:vtechworks.lib.vt.edu:10919/9637