On retransmission control policies in multiple-access communication networks
- 1 February 1985
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Automatic Control
- Vol. 30 (2), 109-117
- https://doi.org/10.1109/TAC.1985.1103904
Abstract
We focus on an earlier proposed class of ALOHA-type retransmission policies intended to control the random accessing of a single-channel communication network by a large number of packet-transmitting, bursty users. These control policies use channel feedback information to adaptively adjust the level of the traffic intensity, and can maintain any input rate less than e-1, for an infinite-population Poisson arrival model. Our analysis focuses on a simplified recursive model for describing locally the dynamics of the traffic intensity. The convergence analysis of this local model is reduced to stability analysis of a deterministic differential equation, and reveals a speed of convergence versus steady-state accuracy tradeoff. We introduce measures for evaluating this tradeoff. We use the proposed measures to show how certain parameter choices might best be made, and to study the effect of feedback limitations and channel errors on the performance of the random-access system. Our results show that with proper parameter choices the considered policies can be made extremely insensitive to channel errors.Keywords
This publication has 15 references indexed in Scilit:
- Hitting-time and occupation-time bounds implied by drift analysis with applicationsAdvances in Applied Probability, 1982
- Decentralized dynamic control of a multiaccess broadcast channelIEEE Transactions on Automatic Control, 1982
- A measure of the tracking capability of recursive stochastic algorithms with constant gainsIEEE Transactions on Automatic Control, 1982
- Collision-Resolution Algorithms and Random-Access CommunicationsPublished by Springer Nature ,1981
- Asymptotic Properties of Stochastic Approximations with Constant CoefficientsSIAM Journal on Control and Optimization, 1981
- Analysis of stochastic approximation schemes with discontinuous and dependent forcing terms with applications to data communication algorithmsIEEE Transactions on Automatic Control, 1980
- Tree algorithms for packet broadcast channelsIEEE Transactions on Information Theory, 1979
- Convergence of recursive adaptive and identification procedures via weak convergence theoryIEEE Transactions on Automatic Control, 1977
- Stability and Optimal Control of the Packet Switching Broadcast ChannelJournal of the ACM, 1977
- Packet Switching in a Multiaccess Broadcast Channel: Dynamic Control ProceduresIEEE Transactions on Communications, 1975