Throughput analysis of Tree‐Type protocols
Yuuji Oie, Shojiro Muro, Toshiharu Hasegawa · Systems and Computers in Japan · 1986
Abstract Tree‐type protocols achieve stable throughput even under heavy channel traffic compared with random access protocols such as the ALOHA types which show bistable behavior. Various binary tree‐type protocols have been studied extensively for channel stability and the improvement of throughput performance. In this paper, closed‐form solutions of the collision resolution time of several d‐ary tree type protocols are obtained, and the effect of the degree value of their protocols on the throughput performance is discussed. As d‐ary tree‐type protocols, we consider the tree protocol, improved tree protocol, adaptive tree protocol and tree protocol with control mini‐slot, and compare their performance. Further, by comparing the stability of the binary tree protocol with that of three ALOHA schemes with different backoff algorithms, we show that the binary tree protocol exhibits very stable behavior even for a heavy traffic load.