Throughput and delay analysis of free access tree algorithm with minislots
Yuuji Oie, T. Suda, Hideo Miyahara, Takatoshi Hasegawa · IEEE Transactions on Communications · 1990
An analysis is made of the throughput and delay performance of two classes of free-access tree algorithms with minislots. In one class, binary feedback information is available in minislots, and in the other, ternary feedback information is available. It is shown that the highest maximum throughput 0.56714 is achieved in the limiting case where the number of minislots in a (large) slot is infinity and minislot overhead is zero. A lower bound of the average transmission delays in these algorithms is analytically derived. The obtained lower bound is also a lower bound of the average delay of the whole class of the free-access algorithms.>