Stable internet routing without global coordination
IEEE/ACM Transactions on Networking (TON)
On inferring autonomous system relationships in the internet
IEEE/ACM Transactions on Networking (TON)
The stable paths problem and interdomain routing
IEEE/ACM Transactions on Networking (TON)
BGP4: Inter-Domain Routing in the Internet
BGP4: Inter-Domain Routing in the Internet
Measuring ISP topologies with rocketfuel
Proceedings of the 2002 conference on Applications, technologies, architectures, and protocols for computer communications
Stateless Routing in Network Simulations
MASCOTS '00 Proceedings of the 8th International Symposium on Modeling, Analysis and Simulation of Computer and Telecommunication Systems
Minimizing Routing State for Light-Weight Network Simulation
MASCOTS '01 Proceedings of the Ninth International Symposium in Modeling, Analysis and Simulation of Computer and Telecommunication Systems
On inferring and characterizing internet routing policies
Proceedings of the 3rd ACM SIGCOMM conference on Internet measurement
An Internet scale simulation setup for BGP
ACM SIGCOMM Computer Communication Review
A model of BGP routing for network engineering
Proceedings of the joint international conference on Measurement and modeling of computer systems
Proceedings of the 35th conference on Winter simulation: driving innovation
Advanced concepts in large-scale network simulation
WSC '05 Proceedings of the 37th conference on Winter simulation
Path preserving scale down for validation of internet inter-domain routing protocols
Proceedings of the 38th conference on Winter simulation
Large-scale testing of the Internet's Border Gateway Protocol (BGP) via topological scale-down
ACM Transactions on Modeling and Computer Simulation (TOMACS)
Criticality analysis of Internet infrastructure
Computer Networks: The International Journal of Computer and Telecommunications Networking
| Hi-index | 0.00 |
Routing table storage demands pose a significant obstacle for large-scale network simulation. On-demand computation of routes can alleviate those problems for models that do not require representation of routing dynamics. However, policy based routes, as used at the interdomain level of the Internet through the BGP protocol, are significantly more difficult to compute on-demand than shortest path intradomain routes due to the semantics of policy based routing and the possibility of routing divergence. We exploit recent theoretical results on BGP routing convergence and measurement results on typical use of BGP routing policies to formulate a model of typical use and an algorithm for on-demand computation of routes that is guaranteed to terminate and produces the same routes as BGP. We show empirically that this scheme can reduce memory usage by orders of magnitude and simultaneously reduce the route computation time compared to a detailed model of the BGP protocol.