带串行干扰消除的d叉树算法分析
Analysis of d-ary Tree Algorithms with Successive Interference Cancellation
AI总结：
本文分析了带串行干扰消除的随机树算法，计算了平均吞吐量等指标，并反驳了仅二叉树使吞吐量最大化的论断。
摘要：
本文计算了带串行干扰消除的随机树算法的平均吞吐量、碰撞数、成功数和空闲时隙。除二叉树的吞吐量外，所有结果均为新发现。我们进一步反驳了仅二叉树使吞吐量最大化的论断。该方法适用于多种可观测指标，可作为进一步分析的蓝图。
英文摘要：
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.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
