Deterministic Tree-Type Algorithm with Reservation Mechanism.

The tree-type algorithm has been proposed and investigated widely as a random multiple-access communication protocol. It is a distributed algorithm but shows a stable throughput performance. Several proposals have been made, including Tsybakov's, for the tree-type algorithm with a reservation mechanism to improve farther the throughput performance. This paper proposes new TREE-DTA with reservation mechanism, which is based on the block access method and employs the deterministic Q-ary tree-type algorithm operating on the terminal addresses as the retransmission algorithm. The feature of the reservation mechanism proposed in this paper is that the realization is easy, compared to various other methods that have been proposed. To evaluate the performance of TREE-DTA with reservation mechanism, a mathematical model is used to derive the approximate expression for the relation between the throughput and the average delay. Furthermore, the performances of TREE-DTA with reservation mechanism are examined by a simulation experiment. The robustness to the system error and the application of the priority scheme are discussed. [ABSTRACT FROM AUTHOR]