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_k/Φ/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.

Name thesis:degree_name

Ph. D.

Level thesis:degree_level

doctoral

Discipline thesis:degree_discipline

Industrial Engineering and Operations Research

Department dc:contributor.department

Industrial Engineering and Operations Research

Grantor dc:publisher

Virginia Polytechnic Institute and State University

Year dc:date.issued

1988

Author dc:creator

• Barnes, John A.

Chairs dc:contributor.committeechair

• Disney, Ralph L.
• TEW, JEFFREY D.

Committee members dc:contributor.committeemember

• Nachlas, Joel A.
• Kiessler, Peter C.
• Day, Martin
• MINTON, ROLAND B.

Statement dc:rights

• In Copyright

Licence dc:rights.uri

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

Language dc:language.iso

en_US

Handle dc:identifier.uri

http://hdl.handle.net/10919/53907

OAI identifier oai:identifier

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