具有连续干扰消除功能的 -ary 树算法分析

IF 0.7 4区数学 Q3 STATISTICS & PROBABILITY

Journal of Applied Probability Pub Date : 2024-02-26 DOI:10.1017/jpr.2023.107

Quirin Vogel, Yash Deshpande, Cedomir Stefanović, Wolfgang Kellerer

{"title":"具有连续干扰消除功能的 -ary 树算法分析","authors":"Quirin Vogel, Yash Deshpande, Cedomir Stefanović, Wolfgang Kellerer","doi":"10.1017/jpr.2023.107","DOIUrl":null,"url":null,"abstract":"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 maximizes throughput. Our method works with many observables and can be used as a blueprint for further analysis.","PeriodicalId":50256,"journal":{"name":"Journal of Applied Probability","volume":"295 1","pages":""},"PeriodicalIF":0.7000,"publicationDate":"2024-02-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Analysis of -ary tree algorithms with successive interference cancellation\",\"authors\":\"Quirin Vogel, Yash Deshpande, Cedomir Stefanović, Wolfgang Kellerer\",\"doi\":\"10.1017/jpr.2023.107\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"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 maximizes throughput. Our method works with many observables and can be used as a blueprint for further analysis.\",\"PeriodicalId\":50256,\"journal\":{\"name\":\"Journal of Applied Probability\",\"volume\":\"295 1\",\"pages\":\"\"},\"PeriodicalIF\":0.7000,\"publicationDate\":\"2024-02-26\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Journal of Applied Probability\",\"FirstCategoryId\":\"100\",\"ListUrlMain\":\"https://doi.org/10.1017/jpr.2023.107\",\"RegionNum\":4,\"RegionCategory\":\"数学\",\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q3\",\"JCRName\":\"STATISTICS & PROBABILITY\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Journal of Applied Probability","FirstCategoryId":"100","ListUrlMain":"https://doi.org/10.1017/jpr.2023.107","RegionNum":4,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q3","JCRName":"STATISTICS & PROBABILITY","Score":null,"Total":0}

引用次数: 0

摘要

我们计算了具有连续干扰消除功能的随机树算法的平均吞吐量、碰撞次数、成功率和空闲时隙。除了二叉树的吞吐量外，所有结果都是新的。我们还进一步推翻了只有二叉树才能使吞吐量最大化的说法。我们的方法适用于许多观测指标，可作为进一步分析的蓝本。

本文章由计算机程序翻译，如有差异，请以英文原文为准。

查看原文本刊更多论文

Analysis of -ary tree algorithms with successive interference cancellation

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 maximizes throughput. Our method works with many observables and can be used as a blueprint for further analysis.

求助全文

通过发布文献求助，成功后即可免费获取论文全文。去求助

来源期刊

Journal of Applied Probability 数学-统计学与概率论

CiteScore

1.50

自引率

10.00%

发文量

审稿时长

6-12 weeks

期刊介绍： Journal of Applied Probability is the oldest journal devoted to the publication of research in the field of applied probability. It is an international journal published by the Applied Probability Trust, and it serves as a companion publication to the Advances in Applied Probability. Its wide audience includes leading researchers across the entire spectrum of applied probability, including biosciences applications, operations research, telecommunications, computer science, engineering, epidemiology, financial mathematics, the physical and social sciences, and any field where stochastic modeling is used. A submission to Applied Probability represents a submission that may, at the Editor-in-Chief’s discretion, appear in either the Journal of Applied Probability or the Advances in Applied Probability. Typically, shorter papers appear in the Journal, with longer contributions appearing in the Advances.