On optimization of polling policy represented by neural network

Authors:
Yutaka Matsumoto
Affiliations:
I.T.S., Inc., 2-2 Hiranoya Shimmachi, Daito, Osaka 574, Japan
Venue:
SIGCOMM '94 Proceedings of the conference on Communications architectures, protocols and applications
Year:
1994

Citing 8
Cited 0

Analysis of polling systems

Analysis of polling systems
On the optimal control of two queues with server setup times and its analysis

SIAM Journal on Computing
Simulated annealing and Boltzmann machines: a stochastic approach to combinatorial optimization and neural computing

Simulated annealing and Boltzmann machines: a stochastic approach to combinatorial optimization and neural computing
A new approach for finding the global minimum of error function* of neural networks

Neural Networks
Learning internal representations by error propagation

Parallel distributed processing: explorations in the microstructure of cognition, vol. 1
On optimal polling policies

Queueing Systems: Theory and Applications - Polling models
Optimization of Polling Systems

Performance '90 Proceedings of the 14th IFIP WG 7.3 International Symposium on Computer Performance Modelling, Measurement and Evaluation
Theory, Volume 1, Queueing Systems

Theory, Volume 1, Queueing Systems

Quantified Score

Hi-index	0.00

Visualization

Abstract

This paper deals with the problem of scheduling a server in a polling system with multiple queues and complete information. We represent the polling policy by a neural network; namely, given the number of waiting customers in each queue, the server determines next queue he should visit according to the output of the neural network. By using the simulated annealing method, we improve the neural polling policy in such a way that the mean delay of customers is minimized. Numerical results show that the present approach is especially valid for asymmetric polling systems whose analytical optimization is considered intractable.