NSFIB construction & aggregation with next hop of strict partial order

The Internet global routing tables have been expanding at a dramatic and increasing rate. In this paper, we propose the next hop of strict partial order to construct and aggregate the Nexthop-Selectable FIB (NSFIB). We control the path stretch caused by NSFIB aggregation by setting an upper limit number of 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.