N-FIB: Scalable, memory efficient name-based forwarding

doi:10.1016/j.jnca.2016.09.007

Return

N-FIB: Scalable, memory efficient name-based forwarding

2016-12-01

PRE

Divya Saxena *

Vaskar Raychoudhury

DOI：10.1016/j.jnca.2016.09.007

Original

Original request for help

Save

Abstract

En 中文

Named Data Networking (NDN) is a promising future Internet which retrieves the content using their names. Content names composed of strings separated by '/' are stored in the NDN Forwarding Information Base (FIB) to forward the incoming packets further. Though NDN has several benefits over traditional IP-based Internet, storing names instead of IP addresses has two major bottlenecks. While it consumes significantly large memory, it incurs higher search and update time. Another issue is the fast growth of routing table size through which FIB will not fit in existing routers' line-card memory. Moreover, frequent updates to the FIB can degrade the packet delivery performance. In this paper, we propose a scalable and memory efficient Patricia trie based name forwarding scheme (called, N-FIB) for FIB. N-FIB supports FIB aggregation to significantly minimize the impact of large FIB size and high FIB update cost. Extensive experiment results show that the N-FIB scheme can reduce memory consumption by 68.18% compared to the BP scheme for 29 million named dataset. Moreover, N-FIB is reducing routers' computation and memory overhead, while supporting strong forwarding correctness.

Keywords:

Named Data Networking

NDN

Forwarding Information Base

FIB

Memory efficient

AI Summary

Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.