An approach for FIB construction and Interest packet forwarding in information centric network

• Published in: Future generation computer systems Vol. 130; pp. 269 - 278
• Main Author: Dutta, Nitul
• Format: Journal Article
• Language: English
• Published: Elsevier B.V 01.05.2022
• Subjects: FIB; Gradient routing; ICN; ICN routing; Routing table; Gradient routing; ICN routing; ICN; FIB; Routing table
• ISSN: 0167-739X; 1872-7115
• DOI: 10.1016/j.future.2022.01.005

Routing protocol in Information Centric Network (ICN) prepares Forward Information Base (FIB) and routing table to assist the process of content retrieval. The content seeker generates Interest packets for the desired content and the routing module forwards it to the right store. One of the challenging tasks in ICN is to design an efficient FIB construction mechanism to improve the performance by adequately forwarding Interest packets to the right store of data. The focus of this manuscript is to address the said challenge of FIB construction and Interest forwarding. First, we propose a scheme for FIB construction from the information communicated through content advertisement. Then, an Interest packet forwarding scheme is presented for faster retrieval of the searched content. The FIB construction is governed by Bloom Filter (BF) enabled content advertisement and the Interest forwarding is guided by information gradient. The proposed scheme is simulated in ndnSim −2.0 and results are compared with both contemporary BF and non-BF based approaches. Parameters such as FIB convergence rate, control overhead, FIB and routing table size, false positive rate, content retrieval delay and Interest success rate are perceived. The experiment shows that the proposed scheme performs better than other approaches. Quantitatively, compared to other protocols, the proposed scheme performs better around 10%–25% in convergence rate, more than 50% in network load, and around 30%–45% in content retrieval delay. •An approach to construct FIB and routing table in ICN using a special Bloom’s filter (BF) is explained.•Uses BF’s information gradient to guide interest packets thereby enables faster content retrieval.•The proposed scheme is compared with existing work through simulation in ndnSim -2.0.