  In this paper, we perform a thorough analysis of tree-algorithms with
multi-packet reception (MPR) and successive interference cancellation (SIC),
showing a number of novel results. We first derive the basic performance
parameters, which are the expected length of the collision resolution interval
and the normalized throughput, conditioned on the number of contending users.
We then study their asymptotic behaviour, identifying an oscillatory component
that amplifies with the increase in MPR. In the next step, we derive the
throughput for the gated and windowed access, assuming Poisson arrivals. We
show that for windowed access, the bound on maximum stable normalized
throughput increases with the increase in MPR. his implies that investing in
advanced physical capabilities, i.e., MPR and SIC pays off from the perspective
of the medium access control algorithm.
