• Publications
  • Influence
Scalable Name Lookup in NDN Using Effective Name Component Encoding
  • Y. Wang, K. He, +4 authors Y. Chen
  • Computer Science
  • IEEE 32nd International Conference on Distributed…
  • 18 June 2012
TLDR
We propose an effective Name Component Encoding (NCE) solution with the following two techniques: (1) A code allocation mechanism is developed to achieve memory-efficient encoding for name components, (2) We apply an improved State Transition Arrays to accelerate the longest name prefix matching and design a fast and incremental update mechanism which satisfies the special requirements of NDN forwarding process. Expand
  • 122
  • 16
  • PDF
Mitigate DDoS attacks in NDN by interest traceback
TLDR
We present a specific and concrete scenario of DDoS attack in NDN, where perpetrators make use of NDN's packet forwarding rules to send out Interest packets with spoofed names as attacking packets. Expand
  • 99
  • 16
  • PDF
Wire Speed Name Lookup: A GPU-based Approach
TLDR
This paper studies the name lookup issue with longest prefix matching, which is widely used in URL filtering, content routing/switching, etc. Expand
  • 97
  • 14
  • PDF
On Pending Interest Table in Named Data Networking
TLDR
This paper presents a thorough study of Pending Interest Table (PIT) in NDN/CCN and proposes a Name Component Encoding (NCE) solution to shrink PIT size and accelerate access operations. Expand
  • 88
  • 12
  • PDF
NameFilter: Achieving fast name lookup with low memory cost via applying two-stage Bloom filters
TLDR
We design, implement and evaluate NameFilter, a two-stage Bloom filter-based scheme for Named Data Networking name lookup, in which the first stage determines the length of a name prefix, and the second stage looks up the prefix in a narrowed group of Bloom filters based on the results from first stage. Expand
  • 82
  • 9
  • PDF
Fast name lookup for Named Data Networking
  • Y. Wang, Boyang Xu, +5 authors B. Liu
  • Computer Science
  • IEEE 22nd International Symposium of Quality of…
  • 26 May 2014
TLDR
In this paper, we propose a fast name lookup scheme for Named Data Networking via reconstructing the data structure of FIB to support greedy search strategy and improving the basic string-oriented perfect hash table. Expand
  • 34
  • 6
  • PDF
BFAST: Unified and scalable index for NDN forwarding architecture
TLDR
We propose a data structure called BFAST to compose an index that can simultaneously accommodate CS, PIT and FIB in the NDN forwarding architecture. Expand
  • 27
  • 4
  • PDF
Parallel Name Lookup for Named Data Networking
TLDR
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. Expand
  • 29
  • 4
  • PDF
Greedy name lookup for named data networking
Different from the IP-based routers, Named Data Networking routers forward packets by content names, which consist of characters and have variable and unbounded length. This kind of complex nameExpand
  • 14
  • 3
CASE: Cache-assisted stretchable estimator for high speed per-flow measurement
TLDR
We propose CASE, a cache-assisted stretchable estimator, which uses the on-chip memory as the fast cache of the off-chip SRAM. Expand
  • 25
  • 2