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.

翻译：在文章中,我们计算了平均吞吐量、碰撞次数、成功和闲置位置,随机树算法,连续取消干扰。除了二进制树的吞吐量外,所有结果都是新的。我们进一步反驳了只有二进制树才能实现最大吞吐量的说法。我们的方法与许多可观测到的数据相配合,可以用作进一步分析的蓝图。