Traffic processes and sojourn times in finite Markovian queues
dc.contributor.author | Barnes, John A. | en |
dc.contributor.committeecochair | Disney, Ralph L. | en |
dc.contributor.committeecochair | TEW, JEFFREY D. | en |
dc.contributor.committeemember | Nachlas, Joel A. | en |
dc.contributor.committeemember | Kiessler, Peter C. | en |
dc.contributor.committeemember | Day, Martin | en |
dc.contributor.committeemember | MINTON, ROLAND B. | en |
dc.contributor.department | Industrial Engineering and Operations Research | en |
dc.date.accessioned | 2015-06-29T22:07:06Z | en |
dc.date.available | 2015-06-29T22:07:06Z | en |
dc.date.issued | 1988 | en |
dc.description.abstract | 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. | en |
dc.description.degree | Ph. D. | en |
dc.format.extent | vi, 100 leaves | en |
dc.format.mimetype | application/pdf | en |
dc.identifier.uri | http://hdl.handle.net/10919/53907 | en |
dc.language.iso | en_US | en |
dc.publisher | Virginia Polytechnic Institute and State University | en |
dc.relation.isformatof | OCLC# 19736143 | en |
dc.rights | In Copyright | en |
dc.rights.uri | http://rightsstatements.org/vocab/InC/1.0/ | en |
dc.subject.lcc | LD5655.V856 1988.B3783 | en |
dc.subject.lcsh | Markov processes | en |
dc.subject.lcsh | Queuing theory | en |
dc.title | Traffic processes and sojourn times in finite Markovian queues | en |
dc.type | Dissertation | en |
dc.type.dcmitype | Text | en |
thesis.degree.discipline | Industrial Engineering and Operations Research | en |
thesis.degree.grantor | Virginia Polytechnic Institute and State University | en |
thesis.degree.level | doctoral | en |
thesis.degree.name | Ph. D. | en |
Files
Original bundle
1 - 1 of 1