An Efficient Prefix Caching Scheme for Fast Forwarding in Named Data Networking

摘要

Named data networking (NDN) has recently received much attention as a promising structure for information-centric 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.