Random multiple access in binary feedback channel (Q1174079)

In the paper random multiple-access algorithms with binary feedback channels are considered. \textit{N. Mehravari's} algorithm [IEEE Trans. Inf. Theory, IT--36, No. 3, 614-622 (1990)] with two types of feedback channel: ``successful transmission-non-successful transmission'' and ``empty slot-non-empty slot'', is analyzed. Two variants of the algorithm differing in the choice of the packet transmission beginning time point are considered. Using standard methods of probabilistic calculus, generation functions and recurrence equation sets, transmission system throughput and upper limits on packet delays for several versions of the algorithm are calculated.