Abstract
dc:description.abstractIn the past several decades, matrix analytic methods have proven effective at studying two important sub-classes of block-structured Markov processes: G/M/1-type Markov processes and M/G/1-type Markov processes. These processes are often used to model many types of random phenomena due to their underlying primitives having phase-type distributions. When studying block-structured Markov processes and its sub-classes, two key quantities are the “rate matrix” R and a matrix of probabilities typically denoted G. In [30], Neuts shows that the stationary distribution of a Markov process of G/M/1-type, when it exists, possess a matrix-geometric relationship with R. Ramaswami’s formula [32] shows that the stationary distribution of an M/G/1-type Markov process satisfies a recursion involving a well-defined matrix of probabilities, typically denoted as G. The first result we present is a new derivation of the stationary distribution for Markov processes of G/M/1-type using the random-product theory found in Buckingham and Fralix [9]. This method can also be modified to derive the Laplace transform of each transition function associated with a G/M/1-type Markov process. Next, we study the time-dependent behavior of block-structured Markov processes. In [15], Grassmann and Heyman show that the stationary distribution of block-structured Markov processes can be expressed in terms of infinitely many R and G matrices. We show that the Laplace transforms of the transition functions associated with block-structured Markov processes satisfies a recursion involving an infinite collection of R matrices. The R matrices are shown to be able to be expressed in terms of an infinite collection of G matrices, which are solutions to fixed-point equations and can be computed iteratively. Our final result uses the random-product theory to a study an M/M/1 queueing model in a two state random environment. Though such a model is a block-structured Markov process, we avoid computing any R or G matrices and instead show that the stationary distribution can be written exactly as a linear combination of scalars that can be determined recursively.
Degree
thesis:*- Name thesis:degree_name
- Doctor of Philosophy (PhD)
- Level thesis:degree_level
- Dissertation
- Discipline thesis:degree_discipline
- Mathematical Science
Author and committee
dc:creator, dc:contributor.*- Author dc:creator
-
- Joyner, Jason
- Contributors dc:contributor
-
- Dr. Brian Fralix, Committee Chair
- Dr. Peter Kiessler
- Dr. Xin Liu
- Dr. Robert Lund
Identifiers
dc:identifier.*- Repository record dc:identifier
- https://open.clemson.edu/all_dissertations/1724