Reinforcing Reachable Routes

Details Reinforcing Reachable Routes Reinforcing Reachable Routes

2002-07-21

arxiv.org/abs/cs/0207073v1

Computer Science

Networking and Internet Architecture

Scientific paper

This paper studies the evaluation of routing algorithms from the perspective of reachability routing, where the goal is to determine all paths between a sender and a receiver. Reachability routing is becoming relevant with the changing dynamics of the Internet and the emergence of low-bandwidth wireless/ad-hoc networks. We make the case for reinforcement learning as the framework of choice to realize reachability routing, within the confines of the current Internet infrastructure. The setting of the reinforcement learning problem offers several advantages, including loop resolution, multi-path forwarding capability, cost-sensitive routing, and minimizing state overhead, while maintaining the incremental spirit of current backbone routing algorithms. We identify research issues in reinforcement learning applied to the reachability routing problem to achieve a fluid and robust backbone routing framework. The paper is targeted toward practitioners seeking to implement a reachability routing algorithm.

Affiliated with

Also associated with

No associations

Rating

Reinforcing Reachable Routes does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Reinforcing Reachable Routes, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Reinforcing Reachable Routes will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-551468