Return to search

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. / Ph. D.

Identiferoai:union.ndltd.org:VTETD/oai:vtechworks.lib.vt.edu:10919/26090
Date26 February 2008
CreatorsNasr, Walid
ContributorsIndustrial and Systems Engineering, Taaffe, Michael R., Nachlas, Joel A., Pasupathy, Raghu, Bish, Ebru K., Nelson, Barry
PublisherVirginia Tech
Source SetsVirginia Tech Theses and Dissertation
Detected LanguageEnglish
TypeDissertation
Formatapplication/pdf
RightsIn Copyright, http://rightsstatements.org/vocab/InC/1.0/
RelationETD_PhD_Walid_Nasr.pdf

Page generated in 0.002 seconds