Properties of data flow frameworks: a unified model
Acta Informatica
A unified approach to global program optimization
POPL '73 Proceedings of the 1st annual ACM SIGACT-SIGPLAN symposium on Principles of programming languages
Semiring frameworks and algorithms for shortest-distance problems
Journal of Automata, Languages and Combinatorics
FIAT: A Framework for Interprocedural Analysis and Transfomation
Proceedings of the 6th International Workshop on Languages and Compilers for Parallel Computing
A Generic Framework for Parallelization of Network Simulations
MASCOTS '99 Proceedings of the 7th International Symposium on Modeling, Analysis and Simulation of Computer and Telecommunication Systems
Reducing the Size of Routing Tables for Large-scale Network Simulation
Proceedings of the seventeenth workshop on Parallel and distributed simulation
Network routing with path vector protocols: theory and applications
Proceedings of the 2003 conference on Applications, technologies, architectures, and protocols for computer communications
Large-scale network simulation techniques: examples of TCP and OSPF models
ACM SIGCOMM Computer Communication Review
Collecting the internet AS-level topology
ACM SIGCOMM Computer Communication Review
Proceedings of the 2005 conference on Applications, technologies, architectures, and protocols for computer communications
An Efficient Routing Mechanism in Network Simulation
Proceedings of the 20th Workshop on Principles of Advanced and Distributed Simulation
Compilers: Principles, Techniques, and Tools (2nd Edition)
Compilers: Principles, Techniques, and Tools (2nd Edition)
Network-wide prediction of BGP routes
IEEE/ACM Transactions on Networking (TON)
Data Flow Analysis: Theory and Practice
Data Flow Analysis: Theory and Practice
Hi-index | 0.00 |
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. We base the policy simulation framework on the Routing Algebra Meta-Language (RAML), which is a formal framework for specifying routing policies. Our theoretical contributions include proving that the signatures and the meet operation induced by the preference operator in RAML define a semilattice and that routing policy simulation frameworks are analogous to data-flow analysis frameworks. The main problem we address is that direct implementation of routing policy simulation has scaling issues due to the O(n^2) memory requirements for routing tables. However, due to properties of routing algebras specified in RAML, we are able to segment the simulation problem into multiple runs that propagate route information for subsets of the network on each run. This strategy enables us to perform a simulation that does not exceed system memory on typical desktops and enables the 43 minute, parallel simulation of a real network topology (33k nodes) and an approximation of the common BGP protocol.