On retransmission control policies in multiple-access communication networks

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.

[1]  Toby Berger,et al.  Poisson multiple-access contention with binary feedback , 1984, IEEE Trans. Inf. Theory.

[2]  A. Benveniste,et al.  Analysis of stochastic approximation schemes with discontinuous and dependent forcing terms with applications to data communication algorithms , 1980 .

[3]  J. Massey.  Collision-Resolution Algorithms and Random-Access Communications , 1981 .

[4]  Lawrence G. Roberts,et al.  ALOHA packet system with and without slots and capture , 1975, CCRV.

[5]  Norman M. Abramson,et al.  THE ALOHA SYSTEM: another alternative for computer communications , 1899, AFIPS '70 (Fall).

[6]  Erol Gelenbe,et al.  Stability and Optimal Control of the Packet Switching Broadcast Channel , 1977, JACM.

[7]  B. Hajek.  Hitting-time and occupation-time bounds implied by drift analysis with applications , 1982, Advances in Applied Probability.

[8]  H. Kushner,et al.  Asymptotic Properties of Stochastic Approximations with Constant Coefficients. , 1981 .

[9]  M. Ferguson,et al.  On the Control, Stability, and Waiting Time in a Slotted ALOHA Random-Access System , 1975, IEEE Trans. Commun..

[10]  Yorktown Heights,et al.  Packet Switching in a Multiaccess Broadcast Channel: Dynamic Control Procedures , 1975 .

[11]  A. Benveniste,et al.  A measure of the tracking capability of recursive stochastic algorithms with constant gains , 1982 .

[12]  Adrian Segall,et al.  Recursive estimation from discrete-time point processes , 1976, IEEE Trans. Inf. Theory.

[13]  Bruce Hajek,et al.  Decentralized dynamic control of a multiaccess broadcast channel , 1982 .

[14]  Leonard Kleinrock,et al.  Packet Switching in a Multiaccess Broadcast Channel: Dynamic Control Procedures , 1975, IEEE Trans. Commun..

[15]  John Capetanakis,et al.  Tree algorithms for packet broadcast channels , 1979, IEEE Trans. Inf. Theory.

[16]  H. Kushner.  Convergence of recursive adaptive and identification procedures via weak convergence theory , 1977 .