Named data networking (NDN) has recently received much attention as a promising structure for informationcentric networking. The name lookup in NDN is a fairly complicated process because of the unbounded name space and its variable string matching characteristics. This paper proposes a prefix caching scheme for fast name lookup in the forwarding information base (FIB) of NDN. It is based on the critical distance that is the longest distance between a prefix and its child prefixes. Caching a non-leaf prefix can lead to incorrect lookup results. In the proposed scheme the non-leaf prefix is expanded for caching based on the critical distance to avoid such incorrect results. This scheme can be applied to any kind of underlying FIB to employ the spatial locality. We also simulate and evaluate our scheme in comparison with other schemes. Experiment results show that our scheme has a higher cache hit ratio than other schemes.
Named data networking, Prefix caching, Fast forwarding, Critical distance, Prefix expansion.
Jinsoo KIM, Junghwan KIM, "An Efficient Prefix Caching Scheme for Fast Forwarding in Named Data Networking", Studies in Informatics and Control, ISSN 1220-1766, vol. 27(2), pp. 175-182, 2018. https://doi.org/10.24846/v27i2y201805
All articles published by Studies in Informatics and Control (SIC) are published in accordance with the terms and conditions of the Creative Commons Attribution License (CC BY-NC-SA 4.0).