Designing a learning-automata-based controller for client/server systems: a methodology

A client/server model which employs a polling policy as its access strategy is considered. We propose a learning-automata-based approach for polling in order to improve the throughput-delay performance of the system. Each client has an associated queue and the server performs selective polling such that the next client to be served is identified by a learning automaton. The learning automaton updates each client's choice probability according to the feedback information. Simulation results have shown that the proposed polling policy is beneficial in comparison to the conventional round-robin polling when operating under bursty traffic conditions.

[1]  Georgios I. Papadimitriou,et al.  Learning-automata-based TDMA protocols for broadcast communication systems with bursty traffic , 2000, IEEE Communications Letters.

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

[3]  Joseph P. LaSalle,et al.  A Course in Mathematical Analysis , 1906, Nature.

[4]  Sem C. Borst,et al.  Waiting-Time Approximations for Multiple-Server Polling Systems , 1998, Perform. Evaluation.

[5]  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..

[6]  Athena Vakali,et al.  A New Approach to the Design of High Performance Multiple Disk Subsystems: Dynamic Load Balancing Schemes , 2000, HPCN Europe.

[7]  Kumpati S. Narendra,et al.  On the Behavior of a Learning Automaton in a Changing Environment with Application to Telephone Traffic Routing , 1980, IEEE Transactions on Systems, Man, and Cybernetics.

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

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

[10]  G.I. Papadimitriou,et al.  Self-adaptive TDMA protocols for WDM star networks: a learning-automata-based approach , 1999, IEEE Photonics Technology Letters.

[11]  Moshe Sidi,et al.  Polling systems: applications, modeling, and optimization , 1990, IEEE Trans. Commun..

[12]  Attahiru Sule Alfa,et al.  Analysis of a time-limited polling system , 1998, Comput. Commun..

[13]  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.

[14]  Adele A. Rescigno,et al.  Optimal polling in communication networks , 1994, Proceedings of 1994 6th IEEE Symposium on Parallel and Distributed Processing.

[15]  Georgios I. Papadimitriou.  Hierarchical Discretized Pursuit Nonlinear Learning Automata with Rapid Convergence and High Accuracy , 1994, IEEE Trans. Knowl. Data Eng..

[16]  Rocky K. C. Chang,et al.  A novel approach to queue stability analysis of polling models , 2000, Perform. Evaluation.

[17]  Yutaka Matsumoto.  On optimization of polling policy represented by neural network , 1994, SIGCOMM 1994.

[18]  Robert D. van der Mei,et al.  Distribution of the Delay in Polling Systems in Heavy Traffic , 1999, Perform. Evaluation.