Toward fast NDN software forwarding lookup engine based on hash tables

Authors:

Open Access

29 October 2012

conference paper
Published by Association for Computing Machinery (ACM)

p. 85-86
DOI:10.1145/2396556.2396575

Abstract

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.

Keywords

HASH TABLE
NAMED DATA NETWORKING
PACKET FORWARDING ENGINE

This publication has 3 references indexed in Scilit:

Scalable NDN Forwarding: Concepts, Issues and Principles
2012
Scalable Name Lookup in NDN Using Effective Name Component Encoding
2012
Networking named content
2009