|
Problemy Peredachi Informatsii, 1992, Volume 28, Issue 2, Pages 78–85
(Mi ppi1348)
|
|
|
|
Communication Network Theory
The Throughput of the Stack Algorithm in a Channel with $N$-Conflicts
B. S. Tsybakov, A. Yu. Privalov
Abstract:
A stack algorithm with $Q$-ary conflict resolution is considered in an RMA channel with $N$-conflicts. An equation for the throughput of the stack algorithm for given $N$ and $Q$ is derived. The throughputs for various $N$ and $Q$ are calculated numerically. Throughput optimization by $Q$ for a given $N$ is performed.
Received: 28.03.1991
Citation:
B. S. Tsybakov, A. Yu. Privalov, “The Throughput of the Stack Algorithm in a Channel with $N$-Conflicts”, Probl. Peredachi Inf., 28:2 (1992), 78–85; Problems Inform. Transmission, 28:2 (1992), 168–174
Linking options:
https://www.mathnet.ru/eng/ppi1348 https://www.mathnet.ru/eng/ppi/v28/i2/p78
|
Statistics & downloads: |
Abstract page: | 266 | Full-text PDF : | 82 |
|