多通道并行竞争树算法（MP-CTA）的延迟分析
Delay Analysis of Multichannel Parallel Contention Tree Algorithms (MP-CTA)
摘要：
竞争树算法最初是为了解决时隙ALOHA在多址接入方案中的稳定吞吐量问题而提出的。即使在树算法的吞吐量是稳定的，请求的延迟可能会增长到无穷大，相对于系统的到达率。延迟很大程度上取决于对树结构的探索，即，广度搜索或深度搜索。广度搜索是快速探索树的必要条件。延迟的解析概率分布主要适用于深度搜索，但不能推广到所有广度搜索。在本文中，我们填补了这一空白，通过任意分组的分支，并包括在延迟分析。这使得能够获得运行广度优先搜索探索的任何争用树算法的延迟分析。我们通过模拟表明，分析是一致的实现。
英文摘要：
Contention tree algorithm is initially invented as a solution to improve the stable throughput problem of Slotted ALOHA in multiple access schemes. Even though the throughput is stabilized in tree algorithms, the delay of requests may grow to infinity with respect to the arrival rate of the system. Delay depends heavily on the exploration of the tree structure, i.e., breadth search, or depth search. Breadth search is necessary for faster exploration of tree. The analytical probability distribution of delay, which is available mostly for depth search, is not generalizable to all breadth search. In this paper we fill this gap through though arbitrary grouping of branches and including this in the delay analysis. This enables obtaining the delay analysis of any contention tree algorithm that runs a breadth first search exploration. We show through simulations that the analysis is in agreement with the realizations.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
