Table of Contents: :: Library Catalog

Cover Image

Saved in:

Bibliographic Details
Main Authors:	Vogel, Quirin, Deshpande, Yash, Stefanović, Cedomir, Kellerer, Wolfgang
Format:	Preprint
Published:	2023
Subjects:	Probability Information Theory Networking and Internet Architecture 68W40, 60J85 (Primary), 68W20, 60K20 (Secondary)
Online Access:	https://arxiv.org/abs/2302.08145
Tags:	Add Tag No Tags, Be the first to tag this record!

Table of Contents:

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.