On the Maximum Stable Throughput of Tree Algorithms With Free Access

Abstract

A simple numerical procedure is presented to determine the maximum stable throughput (MST) of various tree algorithms with free access by defining an associated multitype branching process such that the criticality of the branching process corresponds to the stability of the tree algorithm. More precisely, a bisection algorithm is proposed that only requires the computation of the dominant eigenvalue of the expectation matrix of the branching process, the size of which is typically below 20, at each step. Using this novel approach, many existing results on free-access tree algorithms are reproduced without much effort (e.g., channels with/without noise, variable length packets, interference cancellation, etc.). Furthermore, in an almost plug-and-play manner, the MST of the free access equivalent of many existing results on tree algorithms with blocked access is established (e.g., channels with capture, control signals, multireception capabilities, etc.). The method can be applied to the class of independent and identically distributed (i.i.d.) arrival processes, which includes the Poisson process as a special case. Apart from determining the MST, the probability that a size <i xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">i</i> collision is resolved in a finite amount of time when the arrival rate exceeds the MST can also be computed. Some limitations of the proposed methodology are discussed as well.