Analysis of d-ary tree algorithms with successive interference cancellation
DOI10.1017/JPR.2023.107zbMATH Open1547.68848MaRDI QIDQ6617615FDOQ6617615
Authors: Quirin Vogel, Yash Deshpande, Čedomir Stefanović, Wolfgang Kellerer 
Publication date: 11 October 2024
Published in: Journal of Applied Probability (Search for Journal in Brave)
Applications of branching processes (60J85) Probability in computer science (algorithm analysis, random structures, phase transitions, etc.) (68Q87) Randomized algorithms (68W20) Analysis of algorithms (68W40) Applications of Markov renewal processes (reliability, queueing networks, etc.) (60K20)
Cites Work
- Title not available (Why is that?)
- Random Trees
- Random walk: A modern introduction
- Mellin transforms and asymptotics: Harmonic sums
- Title not available (Why is that?)
- Analysis of an asymmetric leader election algorithm
- On a functional equation arising in the analysis of a protocol for a multi-access broadcast channel
- Tree algorithms for packet broadcast channels
- High-Throughput Random Access Using Successive Interference Cancellation in a Tree Algorithm
- Novel characteristics of split trees by use of renewal theory
- <tex>Q</tex>-ary collision resolution algorithms in random-access systems with free or blocked channel access
- Title not available (Why is that?)
- Interrelation of characteristics of blocked RMA stack algorithms
- On the Maximum Stable Throughput of Tree Algorithms With Free Access
- Corrections to “High-Throughput Random Access Using Successive Interference Cancellation in a Tree Algorithm”
This page was built for publication: Analysis of \(d\)-ary tree algorithms with successive interference cancellation
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6617615)
