|
Problemy Peredachi Informatsii, 1992, Volume 28, Issue 1, Pages 97–111
(Mi ppi1340)
|
|
|
|
Communication Network Theory
An Access Algorithm for a Communication Channel
B. S. Tsybakov, S. P. Fedortsev
Abstract:
A multiple-access system with a finite number of stations is examined. The stations of the system are numbered, and their number is assumed to be known. An efficient access algorithm which allows for conflicts and ensures their resolution with the aid of the station numbers is proposed. The average packet delay at a station with a given number is analyzed. It is shown that the delay is smaller than that of a random-multiple-access stack algorithm.
Received: 07.05.1991
Citation:
B. S. Tsybakov, S. P. Fedortsev, “An Access Algorithm for a Communication Channel”, Probl. Peredachi Inf., 28:1 (1992), 97–111; Problems Inform. Transmission, 28:1 (1992), 86–99
Linking options:
https://www.mathnet.ru/eng/ppi1340 https://www.mathnet.ru/eng/ppi/v28/i1/p97
|
Statistics & downloads: |
Abstract page: | 221 | Full-text PDF : | 81 |
|