Analytic properties of contention tree-algorithms

This article studies the statistical properties of multiple-access contention tree-algorithms with ternary feedback for an arbitrary degree of node. Accurate analytical approximations are given for the expectation value of the number of levels required for a random contender to have successful access, as well as of the number of levels and of the number of contention frames required to provide access for all contenders.