Nonergodicity of mathematic model of a random access network

We have considered a random access communication network with conflicts of requests, which mean that the arriving request and request under service are sent to a retrial pool. For a process of system states changing the embedded Markov chain is built up. The theorem on non-ergodicity of Markov chain, which proves the instability of functioning of the computer communication network managed by a random multiple access, is formulated.