On the use of stochastic estimator learning automata for dynamic channel allocation in broadcast networks

Due to its fixed assignment nature, the well-known TDMA protocol suffers from poor performance when the offered traffic is bursty. In this paper, a new time division multiple access protocol which is capable of operating efficiently under bursty traffic conditions is introduced. According to the proposed protocol, the station which grants permission to transmit at each time slot is selected by means of stochastic estimator learning automata. The system which consists of the automata and the network is analyzed and it is proved that the probability of selecting an idle station asymptotically tends to be minimized. Therefore, the number of idle slots is drastically reduced and consequently, the network throughput is improved. Furthermore, due the use of a stochastic estimator, the automata are capable of being rapidly adapted to the sharp changes of the dynamic bursty traffic environment. Extensive simulation results are presented which indicate that the proposed protocol achieves a significantly higher performance than other well-known time division multiple access protocols when operating under bursty traffic conditions.

[1]  C. Joergensen,et al.  Analysis of a WDM packet switch with improved performance under bursty traffic conditions due to tuneable wavelength converters , 1998 .

[2]  Kaddour Najim,et al.  Learning Automata: Theory and Applications , 1994 .

[3]  Georgios I. Papadimitriou,et al.  WDM passive star networks: a learning automata-based architecture , 1996, Comput. Commun..

[4]  Izhak Rubin,et al.  Message delay analysis for TDMA schemes using contiguous-slot assignments , 1992, IEEE Trans. Commun..

[5]  George N. Rouskas,et al.  Performance Analysis of a Photonic Single-Hop ATM Switch Architecutre, with Tunable Transmitters and Fixed Frequency Receivers , 1998, Perform. Evaluation.

[6]  Izhak Rubin,et al.  Access-control disciplines for multi-access communication channels: Reservation and TDMA schemes , 1979, IEEE Trans. Inf. Theory.

[7]  Wesley W. Chu,et al.  On the Analysis and Modeling of a Class of Computer Communication Systems , 1972, IEEE Trans. Commun..

[8]  Georgios I. Papadimitriou,et al.  Self-adaptive random-access protocols for WDM passive star networks , 1995 .

[9]  J. E. Baker,et al.  Media access control for high-speed local area and metropolitan area communications networks , 1990, Proc. IEEE.

[10]  Izhak Rubin,et al.  Message Delays in FDMA and TDMA Communication Channels , 1979, IEEE Trans. Commun..

[11]  Zahava Koren,et al.  WDM passive star-protocols and performance analysis , 1991, IEEE INFCOM '91. The conference on Computer Communications. Tenth Annual Joint Comference of the IEEE Computer and Communications Societies Proceedings.

[12]  Georgios I. Papadimitriou A New Approach to the Design of Reinforcement Schemes for Learning Automata: Stochastic Estimator Learning Algorithms , 1994, IEEE Trans. Knowl. Data Eng..

[13]  Georgios I. Papadimitriou,et al.  Learning automata-based receiver conflict avoidance algorithms for WDM broadcast-and-select star networks , 1996, TNET.

[14]  Kumpati S. Narendra,et al.  Learning Automata - A Survey , 1974, IEEE Trans. Syst. Man Cybern..

[15]  Simon S. Lam Delay Analysis of a Time Division Multiple Access (TDMA) Channel , 1977, IEEE Trans. Commun..