The Internet routing tables have been expanding at a dramatic and increasing rate. Although the latest high-performance routers provide enough capacities, Internet Service Providers (ISPs) cannot afford to upgrade their routers at the pace of routing table growth. Shrinking the routing table, especially the TCAM-based Forwarding Information Base (FIB), is more feasible. In this paper, we propose a scheme to aggregate the FIB based on generalized next hops of strict partial order (SPO). We first use generalized SPO next hops to construct the Nexthop-Selectable FIB (NSFIB), where each prefix has multiple next hops. Our NSFIB aggregation avoids the aggregation performance degrading with the network density increasing, which is one main defect of the traditional single-nexthop FIB aggregation. We then design different levels of aggregation algorithms to aggregate the NSFIB. Besides, we control the path stretch by setting an upper limit to filter bad next hops. We also introduce routing protection by the pre-computed SPO next hops. According to our simulation, our aggregation algorithms shrink the FIB to 5–15%, compared with 20–60% of single-nexthop FIB aggregation algorithms; our method works very well in controlling the path stretch; and SPO next hops protect 50–95% (topology-related) failure-affected packets.

+More

network density aggregation algorithms tcambased forwarding information base internet routing tables topologyrelated failureaffected scheme nexthopselectable fib 2060 of singlenexthop fib aggregation path stretch generalized next hops of strict partial order

Mingwei Xu, Qi Li, Shu-Tao Xia, Qingmin Liao,Qing Li, Dan Wang, Yong Jiang,.Scale the Internet routing table by generalized next hops of strict partial order. 412–413 (0),101-115.

Mingwei Xu, et al."Scale the Internet routing table by generalized next hops of strict partial order" 412–413

Mingwei Xu, Qi Li, Shu-Tao Xia, Qingmin Liao,Qing Li, Dan Wang, Yong Jiang,"Scale the Internet routing table by generalized next hops of strict partial order"