A simple window random access algorithm with advantageous properties
- 1 January 1989
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Information Theory
- Vol. 35 (5) , 1124-1130
- https://doi.org/10.1109/18.42234
Abstract
A simple full-feedback-sensing window random access algorithm is proposed and analyzed. The throughput of the algorithm is 0.429; its delay and resistance to feedback channel errors are better than those induced by J.I. Capetanakis's (ibid., vol.IT-25, p.505-15, Sept. 1979) window algorithm. In addition, the simple operations of the algorithm allow for the analytical evaluation of the output-traffic interdeparture distributionKeywords
This publication has 8 references indexed in Scilit:
- A full sensing window Random-Access algorithm for messages with strict delay constraintsAlgorithmica, 1989
- On the Relation Between the Finite and the Infinite Population Models for a Class of RAA'sIEEE Transactions on Communications, 1987
- A Method for the Delay Analysis of Random Multiple-Access Algorithms Whose Delay Process is RegenerativeIEEE Journal on Selected Areas in Communications, 1987
- A 0.487 throughput limited sensing algorithmIEEE Transactions on Information Theory, 1987
- Delay Analysis of 0.487 Contention Resolution AlgorithmsIEEE Transactions on Communications, 1986
- On the Throughput of Channel Access Algorithms with Limited SensingIEEE Transactions on Communications, 1986
- Tree algorithms for packet broadcast channelsIEEE Transactions on Information Theory, 1979
- Regenerative processes in the theory of queues, with applications to the alternating-priority queueAdvances in Applied Probability, 1972