Off-campus UNL users: To download campus access dissertations, please use the following link to log into our proxy server with your NU ID and password. When you are done browsing please remember to return to this page and log out.
Non-UNL users: Please talk to your librarian about requesting this dissertation through interlibrary loan.
AN ALGEBRAIC APPROACH TO THE STEADY STATE SOLUTION OF G/G/1//N TYPE LOOPS
Abstract
An explicit solution for a cyclic queueing loop consisting of two general servers and a finite number of customers with first-come-first-served behavior is derived in this dissertation, using the method of stages. Each one of these servers is represented by a vector in a finite dimensional vector space, in which pertinent properties are described. A product space is introduced together with the operational groundrules which combine the properties and interactions of these servers. In particular, the solution of this system is described in a matrix-geometric form, where the matrices are in this product space. The solution is made into a fully explicit closed form, and can be readily implemented. The form of the solution may hint as to how one may proceed to obtain an exact solution for a network of r(> 2) general servers.
Subject Area
Computer science
Recommended Citation
VAN DE LIEFVOORT, ALBERTUS H. A, "AN ALGEBRAIC APPROACH TO THE STEADY STATE SOLUTION OF G/G/1//N TYPE LOOPS" (1982). ETD collection for University of Nebraska-Lincoln. AAI8217561.
https://digitalcommons.unl.edu/dissertations/AAI8217561