|
Problemy Peredachi Informatsii, 1990, Volume 26, Issue 1, Pages 68–75
(Mi ppi594)
|
|
|
|
Communication Network Theory
Comparison of Some Multiple-Access Systems
B. S. Tsybakov
Abstract:
Multiple-access systems use two types of protocols – station control and packet control. Typical representatives of these protocols are compared: time sharing is compared with the stack algorithm, token-passing access is compared with the stack algorithm in a local-area network. Poisson arrivals are assumed for all $M$ stations with equal intensities $\lambda/M$. The comparison criterion is the mean packet delay. The set of possible $(\lambda,M)$ is partitioned into regions, such that station-control systems are preferred in one region and packet-control systems are preferred in the other.
Received: 31.08.1987
Citation:
B. S. Tsybakov, “Comparison of Some Multiple-Access Systems”, Probl. Peredachi Inf., 26:1 (1990), 68–75; Problems Inform. Transmission, 26:1 (1990), 57–62
Linking options:
https://www.mathnet.ru/eng/ppi594 https://www.mathnet.ru/eng/ppi/v26/i1/p68
|
Statistics & downloads: |
Abstract page: | 318 | Full-text PDF : | 121 | First page: | 3 |
|