Scalable Name Lookup for NDN Using Hierarchical Hashing and Patricia Trie

Kim, Junghwan; Ko, Myunggon; Shin, Moon Sun

doi:10.3390/app10031023

Cited by 5 publications

(4 citation statements)

References 25 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…In traditional NDN, each data block has its unique corresponding content name. After network coding is adopted, due to the different naming granularity of interest packages [23], an interest name no longer corresponds to a single data package [24], but to multiple coded packages. The user requests content from the access satellite by sending interest packages.…”

Section: Naming and Finding Coded Packagesmentioning

confidence: 99%

NDN-Based Coded Caching Strategy for Satellite Networks

Liu,

Jin,

et al. 2023

Electronics

View full text Add to dashboard Cite

To solve the transmission correlation issue arising from traditional named data networking (NDN) caching during segmenting contents, where users must obtain data blocks related to the requested file blocks to recover the source data, in this paper, we propose an NDN-based coded caching strategy for low Earth orbit (LEO) satellite networks, using coding operations to remove the transmission correlation of data. To achieve efficient content distribution, the satellite node’s coded package is strategically placed with the objectives of minimizing the backhaul link load and content acquisition latency. The optimization problem is solved by using a multi-colony ant colony algorithm, enabling fast content retrieval. We designed a cluster cooperative distribution mechanism to simplify the satellite network’s management and reduce the load of satellite links for content distribution when covered by multiple satellite nodes. Finally, we compare the multi-objective coded caching (CCMO) introduced in this paper with the most popular (MP) strategy and the random-based coded caching (CCR) strategy; the average cache hit ratio, backhaul link load, and content acquisition delay are compared and analyzed. The results show that CCMO performs better.

show abstract

Section: Naming and Finding Coded Packagesmentioning

confidence: 99%

NDN-Based Coded Caching Strategy for Satellite Networks

Liu,

Jin,

et al. 2023

Electronics

View full text Add to dashboard Cite

show abstract

“…The lookup algorithm of NDN can be divided into two categories in [8]: trie-based [9][10][11][12][13][14], hash-based [15][16][17][18][19][20][21], bloom filter-based [22][23][24] and other kind of lookup algorithm [25][26][27][28]. Considering the demand of Longest Prefix Match (LPM) in different lookup methods, trie-based algorithms, such as NPT [9], NCE [10], MATA [11], BPT [12], can collaborate with the LPM method effectively owing to the feature of trie structure.…”

Section: Related Workmentioning

confidence: 99%

An Entropy-Based Approach: Compressing Names for NDN Lookup

Niu

Yang

2021

IEEE Access

View full text Add to dashboard Cite

NDN (Named Data Networking) is one of the most popular future network architecture, a "clean slate" design for replacing the traditional TCP/IP network. However, the lookup algorithm of FIB entry in NDN is the bottleneck of the current NDN. Owing to the unique identifier of content name, whose length is variable, the size of FIB entries is proliferating, and the effectiveness of lookup algorithms is low. This paper proposed an entropy-oriented name processing mechanism, compressing the content names effectively by bringing in an encoding scheme. This mechanism can be split into two parts: name compression and lookup. The first part compressed the content names and converted them into a kind of code with a smaller size by considering the information redundancies of content names; the second part built a compact structure to minimize the memory footprint of FIB entries with keeping the high lookup performance. This mechanism outperformed many traditional name lookup algorithms, had better flexibility and cost less memory footprint.

show abstract

“…The performance of packet forwarding is highly dependent on the speed of the name lookup and is determined by the efficiency of the LPM. For these reasons, many previous studies on packet forwarding in NDN focused on improving the speed of the name lookup by increasing the efficiency of LPM [4][5][6][7][8][9][10][11][12][13][14][15][16][17][18][19].…”

Section: Name Lookup In Ndn Packet Forwardingmentioning

confidence: 99%

“…The hashing techniques are generally used to map variable-size data to a fixed-size value. Some methods dealt with the name lookup using tries and hashing together [16,17].…”

Section: Introductionmentioning

confidence: 99%

Route Prefix Caching Using Bloom Filters in Named Data Networking

Kim

Shin

2020

Applied Sciences

Self Cite

View full text Add to dashboard Cite

This paper proposes an elaborate route prefix caching scheme for fast packet forwarding in named data networking (NDN) which is a next-generation Internet structure. The name lookup is a crucial function of the NDN router, which delivers a packet based on its name rather than IP address. It carries out a complex process to find the longest matching prefix for the content name. Even the size of a name prefix is variable and unbounded; thus, the name lookup is to be more complicated and time-consuming. The name lookup can be sped up by using route prefix caching, but it may cause a problem when non-leaf prefixes are cached. The proposed prefix caching scheme can cache non-leaf prefixes, as well as leaf prefixes, without incurring any problem. For this purpose, a Bloom filter is kept for each prefix. The Bloom filter, which is widely used for checking membership, is utilized to indicate the branch information of a non-leaf prefix. The experimental result shows that the proposed caching scheme achieves a much higher hit ratio than other caching schemes. Furthermore, how much the parameters of the Bloom filter affect the cache miss count is quantitatively evaluated. The best performance can be achieved with merely 8-bit Bloom filters and two hash functions.

show abstract

Scalable Name Lookup for NDN Using Hierarchical Hashing and Patricia Trie

Cited by 5 publications

References 25 publications

NDN-Based Coded Caching Strategy for Satellite Networks

NDN-Based Coded Caching Strategy for Satellite Networks

An Entropy-Based Approach: Compressing Names for NDN Lookup

Route Prefix Caching Using Bloom Filters in Named Data Networking

Contact Info

Product

Resources

About