Gespeichert in:
| Hauptverfasser: | , , , |
|---|---|
| Format: | Preprint |
| Veröffentlicht: |
2023
|
| Schlagworte: | |
| Online-Zugang: | https://arxiv.org/abs/2302.08145 |
| Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
| _version_ | 1866913817304236032 |
|---|---|
| author | Vogel, Quirin Deshpande, Yash Stefanović, Cedomir Kellerer, Wolfgang |
| author_facet | Vogel, Quirin Deshpande, Yash Stefanović, Cedomir Kellerer, Wolfgang |
| 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. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2302_08145 |
| institution | arXiv |
| publishDate | 2023 |
| record_format | arxiv |
| spellingShingle | Analysis of d-ary Tree Algorithms with Successive Interference Cancellation Vogel, Quirin Deshpande, Yash Stefanović, Cedomir Kellerer, Wolfgang Probability Information Theory Networking and Internet Architecture 68W40, 60J85 (Primary), 68W20, 60K20 (Secondary) 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. |
| title | Analysis of d-ary Tree Algorithms with Successive Interference Cancellation |
| topic | Probability Information Theory Networking and Internet Architecture 68W40, 60J85 (Primary), 68W20, 60K20 (Secondary) |
| url | https://arxiv.org/abs/2302.08145 |