A Method for the Delay Analysis of Random Multiple-Access Algorithms Whose Delay Process is Regenerative
- 1 July 1987
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Journal on Selected Areas in Communications
- Vol. 5 (6) , 1051-1062
- https://doi.org/10.1109/jsac.1987.1146613
Abstract
Random multiple-access algorithms are used to control the accessing of a common communication channel by a large population of bursty channel users. For such algorithms, the induced transmission delay is a key performance measure. A systematic method for finding the delay characteristics of random multiple-access algorithms, whose delay process is regenerative, is presented. The method uses a powerful result from the theory of regenerative processes, in effect, to reduce the problem of determining the delay moments to the problem of solving denumerable dimensional systems of linear equations. Techniques for finding tight bounds on the solutions of such systems are presented. The "0.487" algorithm is used to exemplify the method.Keywords
This publication has 7 references indexed in Scilit:
- Delay Analysis of 0.487 Contention Resolution AlgorithmsIEEE Transactions on Communications, 1986
- A perspective on multiaccess channelsIEEE Transactions on Information Theory, 1985
- Limited feedback sensing algorithms for the packet broadcast channelIEEE Transactions on Information Theory, 1985
- Collision-Resolution Algorithms and Random-Access CommunicationsPublished by Springer Nature ,1981
- On Regenerative Processes in Queueing TheoryPublished by Springer Nature ,1976
- Regenerative processes in the theory of queues, with applications to the alternating-priority queueAdvances in Applied Probability, 1972
- Renewal Theory and its RamificationsJournal of the Royal Statistical Society Series B: Statistical Methodology, 1958