A Preliminary Study on the Aggregation of FIBs at ICN Routers using Routing Strategy

In the last decade, ICN (Information-Centric Networking) has attracted our attention as a replacement of the current Internet. ICN is a network architecture focusing on the content itself rather than the host. This poses a challenge to design ICN to be scalable in terms of the content space. One solution to this scalability concern is to reduce the size of FIB (Forwarding Information Base) of ICN routers. Several studies have already tried to reduce the FIB size, but it has not been fully understood how potentially the routing strategy contributes to reducing the FIB size. Therefore, the present paper reports how much the FIB size at routers can be reduced by our proposed routing strategy, Constrained Shortest-Path Tree (CSPT) routing. The CSPT routing intentionally adopts a detour path passing through a specific node so as to aggregate more FIB entries. As a consequence of the preliminary evaluation, we reveal that our CSPT routing can significantly reduce the FIB size while keeping the path length.