This article is cited in 5 papers

Communication Network Theory

Random Multiple Access in Binary Feedback Channel

B. S. Tsybakov, A. N. Beloyarov


Abstract: We consider random multiple access algorithms of packets to a channel with “empty-not empty” (E – NE) and “success-no success” (S – NS) binary feedback. Upper bounds on mean packet delays are determined for these algorithms.

UDC: 621.394.74-503.5

Received: 12.09.1989

 English version: Problems of Information Transmission, 1990, 26:4, 354–366

Bibliographic databases:

•