A new membership query data structure for name matching in named data networking

What is it about?

In this paper we propose, design and implement a new approach called fast two-dimensional filter with the hash table (FTDF-HT). In the proposed approach, a hash table storing the name prefixes, in a hierarchical manner, is only accessed when the proposed filter (FTDF) states that the name under querying exists. Thus, reducing the unnecessary access to the hash table. Moreover, the access to the hash table will be done with the same hash function that is used for FTDF and this will minimize the search time. Our evaluation results show that FTDF-HT can achieve high lookup speed and exhibit good scalability to large-scale prefixes table.

Featured Image