An analysis of a network of finite-queue, multiple-server facilities.

Author

Juanita Kaye Shukers Grau

Abstract

"An algorithm for listing all possible steady states and for generating the transition matrix for a series of finite-queue, multiple-server facilities is described. This algorithm is compared to a previously developed one. The new algorithm is better since it works for multiple servers and does not require an extra pseudo-facility. Using the list of states and the matrix generated by the new algorithm, exact steady state probabilities can be calculated. Then the probabilities can be used to obtain system statistics which cannot be calculated otherwise"-- Abstract, p. ii

Advisor(s)

Byers, James K.

Committee Member(s)

Wiebe, Henery Allen
Gillett, Billy E.

Department(s)

Computer Science

Degree Name

M.S. in Computer Science

Publisher

University of Missouri--Rolla

Publication Date

1975

Pagination

vii, 78 pages

Note about bibliography

Includes bibliographical references (pages 49-51)

Rights

© 1975 Juanita Kaye Shukers Grau, All rights reserved.

Document Type

Thesis - Open Access

File Type

text

Language

English

Thesis Number

T 4043

Print OCLC #

5983046

Recommended Citation

Grau, Juanita Kaye Shukers, "An analysis of a network of finite-queue, multiple-server facilities." (1975). Masters Theses. 3063.
https://scholarsmine.mst.edu/masters_theses/3063