Title :
Throughput and delay analysis of free access tree algorithm with minislots
Author :
Oie, Yuji ; Suda, Tatsuya ; Miyahara, Hideo ; Hasegawa, Toshiharu
Author_Institution :
Dept. of Electr. Eng., Sasebo Coll. of Technol., Nagasaki, Japan
fDate :
2/1/1990 12:00:00 AM
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
Keywords :
delays; multi-access systems; packet switching; telecommunication channels; average transmission delays; binary feedback information; delay lower bound; free-access tree algorithms; minislot overhead; telecommunication channels; ternary feedback information; throughput; Algorithm design and analysis; Communication networks; Delay; Feedback; H infinity control; Information analysis; Monitoring; Performance analysis; Signal detection; Throughput;
Journal_Title :
Communications, IEEE Transactions on
