Local-area network with random-multiple-access stack algorithm (Q1083422)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 3974882
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Local-area network with random-multiple-access stack algorithm |
scientific article; zbMATH DE number 3974882 |
Statements
Local-area network with random-multiple-access stack algorithm (English)
0 references
1986
0 references
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.
0 references
maximum packet transmission rate
0 references
0.8393113017082214
0 references
0.8346875309944153
0 references
0.8327865600585938
0 references
