The average CRI-length of a controlled ALOHA collision resolution algorithm
From MaRDI portal
Publication:1208718
Recommendations
- On the asymptotics of the average CRI length of the slotted ALOHA collision resolution algorithm
- On a functional equation arising in the analysis of a protocol for a multi-access broadcast channel
- The average CRI-length of a tree collision resolution algorithm in presence of multiplicity-dependent capture effects
- An analysis of a contention resolution algorithm. Another approach
- An access algorithm for a communication channel
Cites work
- scientific article; zbMATH DE number 3814037 (Why is no real title available?)
- scientific article; zbMATH DE number 3932385 (Why is no real title available?)
- scientific article; zbMATH DE number 3176961 (Why is no real title available?)
- scientific article; zbMATH DE number 3111409 (Why is no real title available?)
- <tex>Q</tex>-ary collision resolution algorithms in random-access systems with free or blocked channel access
- A perspective on multiaccess channels
- Estimating the multiplicities of conflicts to speed their resolution in multiple access channels
- On the asymptotics of the average CRI length of the slotted ALOHA collision resolution algorithm
Cited in
(2)
This page was built for publication: The average CRI-length of a controlled ALOHA collision resolution algorithm
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1208718)