Some Markov Chain Problems in the Evaluation of Multiple-Access Protocols
Jeffrey E. Wieselthier, Anthony Ephremides · 2021
In this paper we review models for several variants of a class of multiple-access protocols in communication systems, each of which is characterized by an underlying Markov chain of infinite dimension. The performance evaluation of these protocols requires an exact, or a reasonably accurate, estimate of the steady-state vectors of these Markov chains. For each case we discuss the form of the Markov chains and the computational techniques of truncation and approximation that we have used. These chains have special structure that may not be fully exploited by our techniques; thus improvements may be possible.