Inferring link weights using end-to-end measurements
Proceedings of the 2nd ACM SIGCOMM Workshop on Internet measurment
On the aggregatability of router forwarding tables
INFOCOM'10 Proceedings of the 29th conference on Information communications
SMALTA: practical and near-optimal FIB aggregation
Proceedings of the Seventh COnference on emerging Networking EXperiments and Technologies
Survey and taxonomy of IP address lookup algorithms
IEEE Network: The Magazine of Global Internetworking
Hi-index | 0.00 |
The Internet is facing severe routing scalability problem. The Internet Service Providers cannot afford to upgrade their routers at the pace of routing table growth. Therefore, FIB aggregation has been proposed. However, current single-nexthop FIB aggregation solutions cannot provide a satisfactory performance. In this paper, we first propose the next hop of strict partial order (SPO next hop) to construct the Nexthop-Selectable FIB (NSFIB). The approach guarantees that NSFIB-based aggregation performs better than single-nexthop FIB aggregation, especially in larger and denser backbone networks. We then provide the NSFIB-based aggregation algorithms. According to our simulation, our algorithms can shrink the FIB to 5% and the aggregation performance does not degrade when the network density increases, both of which are a great improvement overhead single-nexthop FIB aggregation.