Analysis of a stack algorithm for random multiple-access communication

DOI10.1109/TIT.1985.1057014zbMath0562.94003MaRDI QIDQ3676042

Guy Fayolle, Philippe Jacquet, Philippe Flajolet, Micha Hofri

Publication date: 1985

Published in: IEEE Transactions on Information Theory (Search for Journal in Brave)

zbMATH Keywords

Capetanakis- Tsybakov-Mikhailov collision resolution algorithmsingle-channel packet switching communications network

Mathematics Subject Classification ID

Queues and service in operations research (90B22) Communication theory (94A05)

Related Items (12)

A queueing theoretic methodology for the analysis of separable conflict resolution algorithms with variable length elementary events ⋮ Limit theorems for recursive algorithms ⋮ Analytical depoissonization and its applications ⋮ An extension of the kantorovich-rubinstein mass-transshipment problem ⋮ An analytic approach to the asymptotic variance of trie statistics and related structures ⋮ Mathematical theory of queueing networks ⋮ A stack protocol of CTM type with quartet feedback ⋮ Scale-free, self-organizing very large sensor networks ⋮ STABILITY AND PERFORMANCE OF STACK ALGORITHMS FOR RANDOM ACCESS COMMUNICATION MODELED AS A TREE STRUCTURED QBD MARKOV CHAIN ⋮ Dynamic tree algorithms ⋮ A probabilistic analysis of some tree algorithms ⋮ Renewal theory in the analysis of tries and strings

This page was built for publication: Analysis of a stack algorithm for random multiple-access communication