No abstract

No abstract

This paper introduces a routing algorithm which distributes the network traffic for each feasible route based on the reinforcement learning scheme. The aim of this algorithm is to reduce the transfer delay caused by congestion of the network. Most routing algorithms based on the reinforcement learning scheme could not avoid forwarding traffic toward the source of data packets. This property creates transfer loops and a lot of packet loss. In particular, the transfer loop may cause change in the order of packets, and also retransmit on the TCP connection. Thus, we employ a method that estimates the lower boundary of the probability for valid route to the destination, and this lower boundary can be used to reject the routes which cause the transfer loop. 

No abstract

No abstract