Abstract
Named Data Networking (NDN) is a promising future Internet architecture 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. To retrieve content through their names poses two main challenges for the NDN FIB: high memory consumption and high lookup time. Therefore, an efficient and scalable data structure is required to store names in FIB. Encoding components in all the names with a unique integer can reduce the memory consumption as well as lookup time. In this paper, we propose a scalable and memory-efficient radix trie based name component encoding scheme, named RaCE, to implement NDN FIB. Our experiment results show that the RaCE scheme is reducing memory consumption by 89.95% and 26.07% compared to the original size of data and NCE [4] scheme for the 29 million dataset, respectively.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
