In this article, we calculate the mean throughput, number of collisions, successes, and idle slots for random tree algorithms with successive interference cancellation. Except for the case of the throughput for the binary tree, all the results are new. We furthermore disprove the claim that only the binary tree maximises throughput. Our method works with many observables and can be used as a blueprint for further analysis.

翻译：本文计算了采用连续干扰消除的随机树算法的平均吞吐量、碰撞次数、成功次数及空闲时隙数。除二叉树吞吐量情形外，所有结果均为新成果。此外，我们否证了仅二叉树能最大化吞吐量的论断。该方法适用于多种可观测变量，可作为进一步分析的蓝图。