Reinforcing Reachable Routes
dc.contributor.author | Varadarajan, Srinidhi | en |
dc.contributor.author | Ramakrishnan, Naren | en |
dc.contributor.author | Thirunavukkarasu, Muthukumar | en |
dc.contributor.department | Computer Science | en |
dc.date.accessioned | 2013-06-19T14:36:01Z | en |
dc.date.available | 2013-06-19T14:36:01Z | en |
dc.date.issued | 2003 | en |
dc.description.abstract | 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. This paper also presents the design, implementation and evaluation of a new reachability routing algorithm that uses a model-based approach to achieve cost-sensitive multi-path forwarding; performance assessment of the algorithm in various troublesome topologies shows consistently superior performance over classical reinforcement learning algorithms. The paper is targeted toward practitioners seeking to implement a reachability routing algorithm. | en |
dc.format.mimetype | application/pdf | en |
dc.identifier | http://eprints.cs.vt.edu/archive/00000654/ | en |
dc.identifier.sourceurl | http://eprints.cs.vt.edu/archive/00000654/01/rrr.pdf | en |
dc.identifier.trnumber | TR-03-08 | en |
dc.identifier.uri | http://hdl.handle.net/10919/20120 | en |
dc.language.iso | en | en |
dc.publisher | Department of Computer Science, Virginia Polytechnic Institute & State University | en |
dc.rights | In Copyright | en |
dc.rights.uri | http://rightsstatements.org/vocab/InC/1.0/ | en |
dc.subject | Networking | en |
dc.title | Reinforcing Reachable Routes | en |
dc.type | Technical report | en |
dc.type.dcmitype | Text | en |
Files
Original bundle
1 - 1 of 1