Analysis of d-ary tree algorithms with successive interference cancellation

DOI10.1017/JPR.2023.107MaRDI QIDQ6617615zbMATH OpenFDO

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)

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://doi.org/10.1017/JPR.2023.107

zbMATH Keywords

asymptotic analysisfunctional equationsplitting algorithmsrandom access

Mathematics Subject Classification ID

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)

Recommendations

• High-Throughput Random Access Using Successive Interference Cancellation in a Tree Algorithm
• Corrections to “High-Throughput Random Access Using Successive Interference Cancellation in a Tree Algorithm”
• <tex>Q</tex>-ary collision resolution algorithms in random-access systems with free or blocked channel access
• Analysis of contention tree algorithms
• On a tree collision resolution algorithm in presence of capture

Cites work

• scientific article; zbMATH DE number 4215340 (Why is no real title available?)
• scientific article; zbMATH DE number 1052006 (Why is no real title available?)
• scientific article; zbMATH DE number 3796336 (Why is no real title available?)
• <tex>Q</tex>-ary collision resolution algorithms in random-access systems with free or blocked channel access
• Analysis of an asymmetric leader election algorithm
• Corrections to “High-Throughput Random Access Using Successive Interference Cancellation in a Tree Algorithm”
• High-Throughput Random Access Using Successive Interference Cancellation in a Tree Algorithm
• Interrelation of characteristics of blocked RMA stack algorithms
• Mellin transforms and asymptotics: Harmonic sums
• Novel characteristics of split trees by use of renewal theory
• On a functional equation arising in the analysis of a protocol for a multi-access broadcast channel
• On the Maximum Stable Throughput of Tree Algorithms With Free Access
• Random Trees
• Random walk: A modern introduction
• Tree algorithms for packet broadcast channels

Cited in

(2)

• Corrections to “High-Throughput Random Access Using Successive Interference Cancellation in a Tree Algorithm”
• A 0.485 throughput randomized part-and-try 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)