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-t...

Full description

Bibliographic Details
Main Author: Barnes, John A.
Other Authors: Industrial Engineering and Operations Research
Format: Others
Language:en_US
Published: Virginia Polytechnic Institute and State University 2015
Subjects:
Online Access:http://hdl.handle.net/10919/53907
Description
Summary: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.