A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2012; you can also visit the original URL.
The file type is application/pdf
.
Parallel Name Lookup for Named Data Networking
2011
2011 IEEE Global Telecommunications Conference - GLOBECOM 2011
Name-based route lookup is a key function for Named Data Networking (NDN). The NDN names are hierarchical and have variable and unbounded lengths, which are much longer than IPv4/6 address, making fast name lookup a challenging issue. In this paper, we propose a parallel architecture for NDN name lookup called Parallel Name Lookup (PNL) which leverages hardware parallelism to achieve high lookup speedup while keeping a low and controllable memory redundancy. The core of PNL is an allocation
doi:10.1109/glocom.2011.6134161
dblp:conf/globecom/WangDJHML11
fatcat:7nsyjuy5qfhb7cdvammkjqlabq