A Distributed Network Routing Algorithm using Reinforcement Learning Method

Hiroyuki Une, Takashi Yokoyama, Shigeya Ikebo, Akinobu Tanaka, Fei Qian · IEEJ Transactions on Electronics Information and Systems · 2002

It is necessary to minimize average of transfer delay time of network. To achieve this, several adaptive routing algorithms are proposed. In this paper, authors described new routing algorithm using ants computing and reinforcement learning method, which is proofed to give optimum resolution in stationary network traffic. Authors show that how this algorithm controls flow of packets and gives good result by comparing other algorithms.

Read the paper · More papers on PaperTik