Analysis of a stack algorithm for random multiple-access communication

Guy Fayolle, Philippe Flajolet, Micha Hofri, Philippe Jacquet · IEEE Transactions on Information Theory · 1985

An exact analysis is given of the main parameters that characterize the properties of the Capetanakis-Tsybakov-Mikhailov collision resolution algorithm with the free-access (continuous input) protocol. In particular, the distributions of the collision resolution interval, the delay experienced by a packet, and the state of the top level of the stack that is maintained by the algorithm are determined.

Read the paper · More papers on PaperTik