Pretested random tree protocol for packet conflict resolution
Abstract
The pretested random addressing tree protocol, a high efficiency conflict resolution algorithm based on a pretest concept in which active sources perform additional random tests in order to obtain more data about the future state of the channel (and therefore lower the probability of empty or conflicting slots) is presented and analyzed. Simulation results are given for the pretest random tree (PRT) protocol and the Capetanakis (1979) basic random tree protocol (BRT), showing dramatic performance improvement for the PRT over the BRT method. The PRT maximum stationary rate is 0.501, by comparison to 0.347 for the BRT.
- Publication:
-
NASA STI/Recon Technical Report A
- Pub Date:
- November 1983
- Bibcode:
- 1983STIA...8415522H
- Keywords:
-
- Channel Capacity;
- Network Control;
- Packet Transmission;
- Random Access;
- Trees (Mathematics);
- Algorithms;
- Communication Networks;
- Communications and Radar