| Аннотація | Context. The relevance of the simulation of p-persistent CSMA algorithm of unequal random multiple access is caused by importance of accounting personal node priorities for execution of adequate assessment of probable and time response characteristics of information transfer in designing widespread fieldbus-networks LonWorks, BacNet, etc.
The aim of this work is to obtain analytical expressions for estimating probabilities of successful and failed node access to the channel, the transmission time information in the network with equal and unequal rivalry of nodes based on p-persistent and predictive p-persistent CSMA algorithms of random multiple access.
Method. The method of probability theory has been used there to solve problems. The analysis of equal and unequal multiple access p-persistent CSMA nodes in the saturation mode of the channel by the transmission with a constant number of node-rivals has been executed. A method of estimating the time of successful transmission of information by the no |