Random infinite trees and supercritical behavior of collision resolution algorithms

An analytical evaluation is given of the behavior of the free access stack algorithm when the input load, a Poisson flow of lambda packet per slot, is above the maximum throughput achievable by the protocol (within 0.360177 packet per slot) under an infinite population model. In particular, the marginal output stream that the system sustains on the channel is analytically and quantitatively derived.<
>