|
Problemy Peredachi Informatsii, 1992, Volume 28, Issue 4, Pages 69–85
(Mi ppi1369)
|
|
|
|
Communication-Network Theory and Large System Science
Lower Bound on Delay in an RMA System with $N$-Conflicts and Errors
B. S. Tsybakov, A. Yu. Privalov
Abstract:
We derive a lower bound on delay, which is valid for any random multiple access algorithm in a channel with errors and $N$-conflicts. For $N=2$ and without errors, our lower bound reduces to the bound of [B. S. Tsybakov and N. B. Likhanov, Probl. Peredachi Inf., 27, no. 3, 73–88].
Received: 16.10.1991
Citation:
B. S. Tsybakov, A. Yu. Privalov, “Lower Bound on Delay in an RMA System with $N$-Conflicts and Errors”, Probl. Peredachi Inf., 28:4 (1992), 69–85; Problems Inform. Transmission, 28:4 (1992), 360–374
Linking options:
https://www.mathnet.ru/eng/ppi1369 https://www.mathnet.ru/eng/ppi/v28/i4/p69
|
Statistics & downloads: |
Abstract page: | 238 | Full-text PDF : | 80 |
|