Donald Bren School of Information and Computer Sciences

This paper analyzes throughput and delay performance of two kinds of free access tree algorithms with mini-slots, and the other is that ternary feedback information is available. In these algorithms Q number of mini-slots are provided within a slot to offer feedback information on the state of the channel. The maximum throughputs of binary and ternary feedback algorithms are analytically obtained. It is also shown that the highest maximum throughput of 0.56714 is achieved when Q approaches infinity and mini-slot overhead goes to zero. The 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 free access algorithms.