Atomized Routing
CAIDA is researching and implementing modifications to BGP routing that aggregate prefixes into equivalence classes (policy atoms) based on common AS path from a given topological location. The motivation behind development of BGP atomization mechanisms is to achieve potential savings in computation and communication costs (by absorbing routing dynamics of prefixes into coarser grained atoms), as well as reduction in BGP table size (there will be far fewer atoms than prefixes). Supported by RIPE NCC.
Principal Investigators: kc claffyPatrick VerkaikAndre Broido
Funding source: NLNet Labs Foundation RIPE Network Coordination Centre Period of performance: October 1, 2002 - October 31, 2003.
Downloads
Atoms software (and its bundled component script, straightenRV) is available for download, but is no longer supported.Router Development Tasks
- Develop an atomized router, a BGP router with extensions for atoms. The router should be deployable in the Internet without breaking BGP or forwarding. The router is based on Zebra BGP router code base.
- Test atomized routing in a confined deployment scenario using vimage.
- Simulate and measure atomized routing performance in BGP++.
Analysis Tasks
- Analyse number and stability of (hypothetical) declared atoms based on observed BGP table snapshots and BGP updates of prefixes.
- Transform observed BGP updates on prefixes to an equivalent stream of updates on (hypothetical) declared atoms. Analyse the the resulting atom update stream.
- Repeat the above analysis under provider-declared atoms, i.e. under the assumption that providers are able to aggregate prefixes originated by stub customers into atoms.
- Determine properties and dynamics of atoms with respect to BGP attributes other than AS path.
People
- Andre Broido
- k claffy
- Christos Xenofontas Dimitropoulos
- Ruomei Gao
- Bradley Huffaker
- Young Hyun
- Ronald van der Pol
- Patrick Verkaik (primary contact)
References
- Andre Broido, kc claffy, `Analysis of RouteViews BGP data: policy atoms', Proceedings of the Network-Related Data Management workshop, Santa Barbara, May 23, 2001.
- Andre Broido, kc claffy, `Complexity of global routing policies'.
- Andre Broido, Evi Nemeth, kc claffy, `Internet Expansion, Refinement, and Churn', European Transactions on Telecommunications, January 2002.
Collaborations