Analysis and Approximations of Time Dependent Queueing Models

Developing equations to compute congestion measures for the general G/G/s/c queueing model and networks of such nodes has always been a challenge. One approach to analyzing such systems is to approximate the model-specified general input processes and distributions by processes and distributions from the more computationally friendly family of phase-type processes and distributions. We develop numerical approximation methods for analysis of general time-dependent queueing nodes by introducing new approximations for the time-dependent first two moments of the number-in-system and departure-count processes.

Name thesis:degree_name

Ph. D.

Level thesis:degree_level

doctoral

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

2008

Author dc:creator

• Nasr, Walid

Chair dc:contributor.committeechair

• Taaffe, Michael R.

Committee members dc:contributor.committeemember

• Nachlas, Joel A.
• Pasupathy, Raghu
• Bish, Ebru K.
• Nelson, Barry

• phase type distribution
• departure process
• queueing systems
• time dependent

Statement dc:rights

• In Copyright

Licence dc:rights.uri

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

Dc Identifier Other

etd-02012008-115247

OAI identifier oai:identifier

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