Scalable Simulation of Complex Network Routing Policies

Modern routing protocols for the internet implement complex policies that take more into account than just path length. However, current routing protocol simulators are limited to either working with hard-coded policies or working on small networks (1000 nodes or less). It is currently not possible to ask questions about how the routing tables will change on all of the autonomous systems (e.g., AT&T, Sprint, etc.) in the internet, given a change in the routing protocol. This paper presents a routing policy simulation framework that enables such simulations to be done on resources that are readily available to researchers, such as a small set of typical desktops. Authors base the policy simulation framework on the Routing Algebra Meta-Language (RAML), which is a formal framework for specifying routing policies.

Provided by: Association for Computing Machinery Topic: Mobility Date Added: May 2010 Format: PDF

Download Now

Find By Topic