A Nonlinear Approach to Robust Routing Based on Reinforcement Learning with State Space Compression and Adaptive Basis Construction

Authors:
Hideki Satoh
Affiliations:
-
Venue:
IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences
Year:
2008

Citing 7
Cited 0

Applied multivariate statistical analysis

Applied multivariate statistical analysis
Routing in the Internet

Routing in the Internet
A performance comparison of multi-hop wireless ad hoc network routing protocols

MobiCom '98 Proceedings of the 4th annual ACM/IEEE international conference on Mobile computing and networking
Reinforcement Learning

Reinforcement Learning
Confidence Based Dual Reinforcement Q-Routing: An adaptive online network routing algorithm

IJCAI '99 Proceedings of the Sixteenth International Joint Conference on Artificial Intelligence
Reinforcement Learning for Continuous Stochastic Actions---An Approximation of Probability Density Function by Orthogonal Wave Function Expansion---

IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences
A State Space Compression Method Based on Multivariate Analysis for Reinforcement Learning in High-Dimensional Continuous State Spaces

IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences

Quantified Score

Hi-index	0.00

Visualization

Abstract

A robust routing algorithm was developed based on reinforcement learning that uses (1) reward-weighted principal component analysis, which compresses the state space of a network with a large number of nodes and eliminates the adverse effects of various types of attacks or disturbance noises, (2) activity-oriented index allocation, which adaptively constructs a basis that is used for approximating routing probabilities, and (3) newly developed control space compression based on a potential model that reduces the control space for routing probabilities. This algorithm takes all the network states into account and reduces the adverse effects of disturbance noises. The algorithm thus works well, and the frequencies of causing routing loops and falling to a local optimum are reduced even if the routing information is disturbed.