Return to search

Traffic processes and sojourn times in finite Markovian queues

This paper gives results on various traffic processes and on the sojourn time distribution for a class of models which operate as Markov processes on finite state spaces. The arrival and the service time processes are assumed to be independent renewal processes with interval distributions of phase-type. The queue capacity is finite. A general class of queue disciplines are considered. The primary models studied are from the M/E<sub>k</sub>/Φ/L class. The input, output, departure and overflow processes are analyzed. Furthermore, the sojourn time distribution is determined. Markov renewal theory provides the main analytical tools. It is shown that this work unifies many previously known results and offers some new results. Various extensions, including a balking model, are studied. / Ph. D.

Identiferoai:union.ndltd.org:VTETD/oai:vtechworks.lib.vt.edu:10919/53907
Date January 1988
CreatorsBarnes, John A.
ContributorsIndustrial Engineering and Operations Research, Nachlas, Joel A., Kiessler, Peter C., Day, Martin, MINTON, ROLAND B., Disney, Ralph L., TEW, JEFFREY D.
PublisherVirginia Polytechnic Institute and State University
Source SetsVirginia Tech Theses and Dissertation
Languageen_US
Detected LanguageEnglish
TypeDissertation, Text
Formatvi, 100 leaves, application/pdf, application/pdf
RightsIn Copyright, http://rightsstatements.org/vocab/InC/1.0/
RelationOCLC# 19736143

Page generated in 0.002 seconds