Throughput analysis of reservation protocols with tree‐type reservation channel

Abstract

AbstractNumerous multiple access protocols have been proposed aiming at an efficient utilization of transmission channels. Among those, the tree‐type protocol is one of the multiple access protocols which provide a stable throughput. Various studies have been made on the tree‐type communication protocols. This paper is concerned especially with the analysis of the throughput of the reservation protocols with tree‐type reservation channel. In the proposed system, the tree‐type protocol is employed to reserve the data slot, providing stable and high throughput. There are two types of tree‐type protocols: the blocked‐access tree protocol which inhibits the transmission of a new packet in the collision resolution interval; and the free‐access tree protocol which does not inhibit the transmission. The reservation protocols employing these two protocols are discussed. Through the analysis, the optimum frame structure for each type is obtained. The maximum throughput of CCA proposed by Lee and Mark, as well as the optimum number of the small reservation slots, are obtained analytically.