Probabilistic-time characteristics of bistable random access networks

Bistable random access networks, probability distribution of the normed number of messages in the retrial buffer and main probabilistic characteristics of the network are investigated. Conditions for a random access network to be bistable are formulated. Formulas for estimating the time of sojourn of the network in the neighborhood of a stable state are derived. The time of stable operation of bistable networks is shown to lie in a wide range of vales and may be quite large, almost unbounded.