|
Problemy Peredachi Informatsii, 1990, Volume 26, Issue 1, Pages 58–67
(Mi ppi593)
|
|
|
|
This article is cited in 1 scientific paper (total in 1 paper)
Communication Network Theory
Bounds on the Capacity of FCFS Multiple-Access Algorithms
N. D. Vvedenskaya, M. S. Pinsker
Abstract:
A class of FCFS (first-come-first-served) multiple-access algorithms is considered. Several subclasses are identified and the capacity of the corresponding algorithms is estimated. A conjecture concerning the capacity of the entire class of FCFS algorithms is advanced.
Received: 28.04.1988
Citation:
N. D. Vvedenskaya, M. S. Pinsker, “Bounds on the Capacity of FCFS Multiple-Access Algorithms”, Probl. Peredachi Inf., 26:1 (1990), 58–67; Problems Inform. Transmission, 26:1 (1990), 49–56
Linking options:
https://www.mathnet.ru/eng/ppi593 https://www.mathnet.ru/eng/ppi/v26/i1/p58
|
Statistics & downloads: |
Abstract page: | 361 | Full-text PDF : | 155 |
|