On the cost of caching locator/ID mappings
CoNEXT '07 Proceedings of the 2007 ACM CoNEXT conference
Evaluating the benefits of the locator/identifier separation
Proceedings of 2nd ACM/IEEE international workshop on Mobility in the evolving internet architecture
Using forgetful routing to control BGP table size
CoNEXT '06 Proceedings of the 2006 ACM CoNEXT conference
Scalable VPN routing via relaying
SIGMETRICS '08 Proceedings of the 2008 ACM SIGMETRICS international conference on Measurement and modeling of computer systems
Accountable internet protocol (aip)
Proceedings of the ACM SIGCOMM 2008 conference on Data communication
Making routers last longer with ViAggre
NSDI'09 Proceedings of the 6th USENIX symposium on Networked systems design and implementation
A stochastic clustering algorithm for swarm compact routing
NGI'09 Proceedings of the 5th Euro-NGI conference on Next Generation Internet networks
A compact routing scheme with lower stretch
NTMS'09 Proceedings of the 3rd international conference on New technologies, mobility and security
An Internet without the Internet protocol
Computer Networks: The International Journal of Computer and Telecommunications Networking
Controlling the growth of internet routing tables through market mechanisms
Proceedings of the Re-Architecting the Internet Workshop
Multi-VPN optimization for scalable routing via relaying
IEEE/ACM Transactions on Networking (TON)
oBGP: an overlay for a scalable iBGP control plane
NETWORKING'11 Proceedings of the 10th international IFIP TC 6 conference on Networking - Volume Part I
Percolation-based routing in the Internet
Journal of Systems and Software
A survey and taxonomy of ID/Locator Split Architectures
Computer Networks: The International Journal of Computer and Telecommunications Networking
Hi-index | 0.00 |
IP routing scalability is based on hierarchical routing, which requires that the IP address hierarchy be aligned with thephysical topology. Both site multi-homing and switching ISPs without renumbering break this alignment, resulting in largerouting tables. This paper presents CRIO: a new approach to IP scalability for both global and VPN routing. Using tunnelingand virtual prefixes, CRIO decouples address hierarchy and physical topology, effectively giving ISPs the ability to trade-offrouting table size for path length. Though CRIO is a new routing architecture, it works with existing data-plane router mechanisms.Through static simulation on a Rocketfuel-measured Internet topology and traffic data from a Tier 1 ISP, we show that CRIOcan shrink the BGP RIB by nearly two orders of magnitude, the global FIB by one order of magnitude, and the VPN FIB by tento twenty times, all with very little increase in overall path length.