On the Aloha throughput-fairness tradeoff
From MaRDI portal
Publication:4589431
DOI10.1109/TIT.2017.2705029zbMATH Open1374.94632arXiv1605.01557OpenAlexW2962949972MaRDI QIDQ4589431FDOQ4589431
Authors: Nan Xie, Steven Weber 
Publication date: 10 November 2017
Published in: IEEE Transactions on Information Theory (Search for Journal in Brave)
Abstract: A well-known inner bound of the stability region of the slotted Aloha protocol on the collision channel with n users assumes worst-case service rates (all user queues non-empty). Using this inner bound as a feasible set of achievable rates, a characterization of the throughput--fairness tradeoff over this set is obtained, where throughput is defined as the sum of the individual user rates, and two definitions of fairness are considered: the Jain-Chiu-Hawe function and the sum-user alpha-fair (isoelastic) utility function. This characterization is obtained using both an equality constraint and an inequality constraint on the throughput, and properties of the optimal controls, the optimal rates, and the fairness as a function of the target throughput are established. A key fact used in all theorems is the observation that all contention probability vectors that extremize the fairness functions take at most two non-zero values.
Full work available at URL: https://arxiv.org/abs/1605.01557
Cited In (1)
This page was built for publication: On the Aloha throughput-fairness tradeoff
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4589431)
