An analytic model for random multiple access in a local computer network

An analytical model is proposed which describes a local computing network of a finite set of subscriber stations which functions by a certain clock-pulse protocol of multiple accesses. For illustration, a network with a non-insistent clock-pulse protocol of multiple access with checking of the carrier and conflict detection is decribed.