Analysis of d-ary Tree Algorithms with Successive Interference Cancellation

Authors Quirin Vogel, Yash Deshpande, Čedomir Stefanović, Wolfgang Kellerer

Publication date 16 February 2023

Applications of branching processes (60J85) Applications of Markov renewal processes (reliability, queueing networks, etc.) (60K20) Randomized algorithms (68W20) Analysis of algorithms (68W40)

Abstract: In this article, we calculate the mean throughput, number of collisions, successes, and idle slots for random tree algorithms with successive interference cancellation. Except for the case of the throughput for the binary tree, all the results are new. We furthermore disprove the claim that only the binary tree maximises throughput. Our method works with many observables and can be used as a blueprint for further analysis.

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 Q6426650)