Analysis of a stack algorithm for random multiple-access communication

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...

Full description

Saved in:
Bibliographic Details
Published in:IEEE transactions on information theory 1985-03, Vol.31 (2), p.244-254
Main Authors: Fayolle, G., Flajolet, P., Hofri, M., Jacquet, P.
Format: Article
Language:English
Subjects:
Applied sciences
Exact sciences and technology
Systems, networks and services of telecommunications
Telecommunications
Telecommunications and information theory
Transmission and modulation (techniques and equipments)
Citations: Items that this one cites
Items that cite this one
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary: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.
ISSN:0018-9448
1557-9654
DOI:10.1109/TIT.1985.1057014