Random multiple access in binary feedback channel (Q1174079)
From MaRDI portal
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Random multiple access in binary feedback channel |
scientific article |
Statements
Random multiple access in binary feedback channel (English)
0 references
25 June 1992
0 references
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.
0 references
upper bounds
0 references
random multiple-access algorithms
0 references
binary feedback channels
0 references
packet delays
0 references