Skip to Main Content
In principle, the access protocols of many communication or computer networks can be modelled as discrete-time Markov chains. In practice, these Markov chains are multidimensional, and due to the vast state space are unsolvable without the use of approximation techniques. Two such techniques are equilibrium point analysis and single station superposition. It is shown that these two seemingly disparate methods are actually equivalent under certain constraints.