Abstract
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.< <ETX xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">></ETX>
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
