Local-Area Network with Random-Multiple-Access Stack Algorithm

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.