In Named Data Networking (NDN), packet forwarding decisions rely upon lookup operations on variable-length hierarchical names instead of fixed-length host addresses. This pivotal feature introduces new challenges in the deployment of NDN at the Internet scale. In this letter, a novel Name Lookup engine with Adaptive Prefix Bloom filter (NLAPB) is conceived, in which each NDN name/prefix is split into B-prefix followed by T-suffix. B-prefix is matched by Bloom filters whereas T-suffix is processed by the small-scale trie. The length of B-prefixes (and T-suffixes) is dynamically throttled based on their popularity in order to accelerate the lookup. Experimental results show that: (i) NLAPB is able to lower the false positive rate with respect to a lookup entirely based on Bloom filters; (ii) it decreases the memory requirements with respect to a trie-based approach; (iii) it reduces processing time with respect to both them.

Scalable Name Lookup with Adaptive Prefix Bloom Filter for Named Data Networking / Quan, W; Xu, C; Guan, J; Zhang, H; Grieco, Luigi Alfredo. - In: IEEE COMMUNICATIONS LETTERS. - ISSN 1089-7798. - 18:1(2014), pp. 102-105. [10.1109/LCOMM.2013.112413.132231]

Scalable Name Lookup with Adaptive Prefix Bloom Filter for Named Data Networking

GRIECO, Luigi Alfredo
2014-01-01

Abstract

In Named Data Networking (NDN), packet forwarding decisions rely upon lookup operations on variable-length hierarchical names instead of fixed-length host addresses. This pivotal feature introduces new challenges in the deployment of NDN at the Internet scale. In this letter, a novel Name Lookup engine with Adaptive Prefix Bloom filter (NLAPB) is conceived, in which each NDN name/prefix is split into B-prefix followed by T-suffix. B-prefix is matched by Bloom filters whereas T-suffix is processed by the small-scale trie. The length of B-prefixes (and T-suffixes) is dynamically throttled based on their popularity in order to accelerate the lookup. Experimental results show that: (i) NLAPB is able to lower the false positive rate with respect to a lookup entirely based on Bloom filters; (ii) it decreases the memory requirements with respect to a trie-based approach; (iii) it reduces processing time with respect to both them.
2014
Scalable Name Lookup with Adaptive Prefix Bloom Filter for Named Data Networking / Quan, W; Xu, C; Guan, J; Zhang, H; Grieco, Luigi Alfredo. - In: IEEE COMMUNICATIONS LETTERS. - ISSN 1089-7798. - 18:1(2014), pp. 102-105. [10.1109/LCOMM.2013.112413.132231]
File in questo prodotto:
Non ci sono file associati a questo prodotto.

I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.

Utilizza questo identificativo per citare o creare un link a questo documento: https://hdl.handle.net/11589/2735
Citazioni
  • Scopus 97
  • ???jsp.display-item.citation.isi??? 87
social impact