Toward fast NDN software forwarding lookup engine based on hash tables

In Named Data Networking (NDN), forwarding lookup is based on tokenized variable-length names instead of fixed-length host addresses, and therefore it requires a new approach for designing a fast packet forwarding lookup engine. In this paper, we propose a design of an NDN software forwarding lookup engine based on hash tables and evaluate its performance with different design options. With a good hash function and table design combined with Bloom filters and data prefetching, we demonstrate that our design reaches about 1.5MPPS with a single thread on an Intel 2.0GHz Xeon processor.

[1]  Bin Liu,et al.  Scalable Name Lookup in NDN Using Effective Name Component Encoding , 2012, 2012 IEEE 32nd International Conference on Distributed Computing Systems.

[2]  Patrick Crowley,et al.  Scalable NDN Forwarding: Concepts, Issues and Principles , 2012, 2012 21st International Conference on Computer Communications and Networks (ICCCN).

[3]  Van Jacobson,et al.  Networking named content , 2009, CoNEXT '09.

[4]  References , 1971 .