Loading…
Adaptive routing algorithm for network load balancing
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 learni...
Saved in:
Published in: | IEEJ transactions on electrical and electronic engineering 2011-09, Vol.6 (5), p.441-449 |
---|---|
Main Authors: | , , |
Format: | Article |
Language: | English |
Subjects: | |
Citations: | Items that this one cites Items that cite this one |
Online Access: | Get full text |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Summary: | 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. © 2011 Institute of Electrical Engineers of Japan. Published by John Wiley & Sons, Inc. |
---|---|
ISSN: | 1931-4973 1931-4981 1931-4981 |
DOI: | 10.1002/tee.20680 |