A simple window random access algorithm with advantageous properties
- 6 January 2003
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE)
Abstract
A simple full-feedback-sensing window random-access algorithm is proposed and analyzed in the presence of the Poisson user model. The throughput of the algorithm is 0.43. The proposed algorithm is better than J.I. Capetanaki's dynamic algorithm (1979) with respect to its delay and resistance to channel errors. The simple operations of the algorithm, along with its regenerative properties, facilitate the computation of the output traffic interdeparture distribution. The obtained distribution is useful in the evaluation of interacting systems which adopt the algorithm for their internal transmissions.> Author(s) Paterakis, M. Dept. of Electr. Eng., Virginia Univ., Charlottesville, VA, USA Papantoni-Kazakos, P.Keywords
This publication has 5 references indexed in Scilit:
- 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
- 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