On characterizing BGP routing table growth
Computer Networks: The International Journal of Computer and Telecommunications Networking - Special issue on The global Internet
A first-principles approach to understanding the internet's router-level topology
Proceedings of the 2004 conference on Applications, technologies, architectures, and protocols for computer communications
IPv4 address allocation and the BGP routing table evolution
ACM SIGCOMM Computer Communication Review
Making routers last longer with ViAggre
NSDI'09 Proceedings of the 6th USENIX symposium on Networked systems design and implementation
Evolution towards global routing scalability
IEEE Journal on Selected Areas in Communications - Special issue title on scaling the internet routing system: an interim report
Dynamics of prefix usage at an edge router
PAM'11 Proceedings of the 12th international conference on Passive and active measurement
Proceedings of the Seventh COnference on emerging Networking EXperiments and Technologies
SMALTA: practical and near-optimal FIB aggregation
Proceedings of the Seventh COnference on emerging Networking EXperiments and Technologies
From ISP address announcement patterns to routing scalability
TMA'12 Proceedings of the 4th international conference on Traffic Monitoring and Analysis
Next hop of strict partial order for NSFIB construction & aggregation
Proceedings of the 2012 IEEE 20th International Workshop on Quality of Service
Approaching optimal compression with fast update for large scale routing tables
Proceedings of the 2012 IEEE 20th International Workshop on Quality of Service
Towards TCAM-based scalable virtual routers
Proceedings of the 8th international conference on Emerging networking experiments and technologies
Efficient FIB caching using minimal non-overlapping prefixes
ACM SIGCOMM Computer Communication Review
Efficient Two Dimensional-IP routing: An incremental deployment design
Computer Networks: The International Journal of Computer and Telecommunications Networking
| Hi-index | 0.00 |
The rapid growth of global routing tables has raised concerns among many Internet Service Providers. The most immediate concern regarding routing scalability is the size of the Forwarding Information Base (FIB), which seems to be growing at a faster pace than router hardware can support. This paper focuses on one potential solution to this problem - FIB aggregation, i.e., aggregating FIB entries without affecting the forwarding paths taken by data traffic. Compared with alternative solutions to the routing scalability problem, FIB aggregation is particularly appealing because it is a purely local software optimization limited within a router, requiring no changes to routing protocols or router hardware. To understand the feasibility of using FIB aggregation to extend router lifetime, we present several FIB aggregation algorithms and evaluate their performance using routing tables and updates from tens of networks. We find that FIB aggregation can reduce the FIB table size by as much as 70% with small computational overhead. We also show that the computational overhead can be controlled through various mechanisms.