Local-area network with random-multiple-access stack algorithm
From MaRDI portal
The authors investigate a local-area network that employs a random- multiple-access stack algorithm. The stack algorithm is generalized to the case in which the stations check the channel and transmit packets of arbitrary length. Upper and lower bounds are obtained for the maximum packet transmission rate in the network. It is shown that the maximum rate tends rapidly to 1 as the packet length increases.
Recommendations
Cited in
(14)- Effect on an unbalanced random number generator on the throughput of a random access local area
- A simple stable RMA algorithm for LAN
- An random multiple access algorithm with finite stack and packet loss
- Accelerated probing of the data channel -- a new multiple-access principle in local area networks
- scientific article; zbMATH DE number 3875136 (Why is no real title available?)
- The blocked stack algorithm of RMA in a network with a finite number of stations
- Analysis of a stack algorithm for random multiple-access communication
- scientific article; zbMATH DE number 4029431 (Why is no real title available?)
- One stochastic process and its application to multiple access in supercritical region
- scientific article; zbMATH DE number 220155 (Why is no real title available?)
- scientific article; zbMATH DE number 4118297 (Why is no real title available?)
- scientific article; zbMATH DE number 862262 (Why is no real title available?)
- Random multiple access of packets to a channel with errors
- Allowance for packet propagation time in random multiple access
This page was built for publication: Local-area network with random-multiple-access stack algorithm
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1083422)
