Computer Science – Networking and Internet Architecture
Scientific paper
2005-11-14
Computer Science
Networking and Internet Architecture
In submission to IEEE Journal on Selected Areas of Communication
Scientific paper
Current directions in network routing research have not kept pace with the latest developments in network architectures, such as peer-to-peer networks, sensor networks, ad-hoc wireless networks, and overlay networks. A common characteristic among all of these new technologies is the presence of highly dynamic network topologies. Currently deployed single-path routing protocols cannot adequately cope with this dynamism, and existing multi-path algorithms make trade-offs which lead to less than optimal performance on these networks. This drives the need for routing protocols designed with the unique characteristics of these networks in mind. In this paper we propose the notion of reachability routing as a solution to the challenges posed by routing on such dynamic networks. In particular, our formulation of reachability routing provides cost-sensitive multi-path forwarding along with loop avoidance within the confines of the Internet Protocol (IP) architecture. This is achieved through the application of reinforcement learning within a probabilistic routing framework. Following an explanation of our design decisions and a description of the algorithm, we provide an evaluation of the performance of the algorithm on a variety of network topologies. The results show consistently superior performance compared to other reinforcement learning based routing algorithms.
Ramakrishnan Naren
Smith Leland
Thirunavukkarasu Muthukumar
Varadarajan Srinidhi
No associations
LandOfFree
A Model Based Approach to Reachability Routing 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 A Model Based Approach to Reachability Routing, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and A Model Based Approach to Reachability Routing will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-218446