The stable paths problem and interdomain routing
IEEE/ACM Transactions on Networking (TON)
Top-Down Network Design (2nd Edition)
Top-Down Network Design (2nd Edition)
Proceedings of the 2005 conference on Applications, technologies, architectures, and protocols for computer communications
Optimal Routing Design (Networking Technology)
Optimal Routing Design (Networking Technology)
On compact routing for the internet
ACM SIGCOMM Computer Communication Review
A measurement study of persistent forwarding loops on the Internet
Computer Networks: The International Journal of Computer and Telecommunications Networking
Studying black holes in the internet with Hubble
NSDI'08 Proceedings of the 5th USENIX Symposium on Networked Systems Design and Implementation
Instability free routing: beyond one protocol instance
CoNEXT '08 Proceedings of the 2008 ACM CoNEXT Conference
Making routers last longer with ViAggre
NSDI'09 Proceedings of the 6th USENIX symposium on Networked systems design and implementation
Internet optometry: assessing the broken glasses in internet reachability
Proceedings of the 9th ACM SIGCOMM conference on Internet measurement conference
Shim6: reference implementation and optimization
NETWORKING'08 Proceedings of the 7th international IFIP-TC6 networking conference on AdHoc and sensor networks, wireless networks, next generation internet
On the aggregatability of router forwarding tables
INFOCOM'10 Proceedings of the 29th conference on Information communications
| Hi-index | 0.00 |
Route Aggregation (RA), the method to supersede a set of routes by a single, more general route, is a fundamental mechanism to the Internet scalability. Yet, despite its importance, it is poorly understood. We present the first systematic analysis of RA via both bottom-up experimental and top-down analytical approaches. We first conduct a set of experiments on RA behaviors of all major routing protocols as implemented by the two leading router vendors. Our experiments show that the RA behaviors vary significantly across routing protocols and vendors. We propose two router level primitives and incorporate them into a canonical router model. The new model captures the diversity of the observed behaviors. With aid of the model, we have advanced the fundamental understanding of RA on three fronts. First, we expose four new types of routing anomaly that can derive from RA. Configuring RA on one router interface can influence how routes are advertised on other interfaces of the same router, impacting network reachability in surprising ways. Second, we demonstrate that determining whether a RA configuration can result in persistent forwarding loops is NP-complete. Finally, we present sufficient conditions for RA primitives to guarantee routing safety, and explore clean-slate designs for RA.