A new name prefix trie with path compression

Lee, Jungwon; Lim, Hyesook

doi:10.1109/icce-asia.2016.7804781

Cited by 10 publications

(7 citation statements)

References 6 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Most previously proposed name lookup schemes can be classified into TCAM-based [11], trie-based [12][13][14][15], and hash-based [16][17][18][19][20][21] ones.…”

Section: Related Workmentioning

confidence: 99%

See 1 more Smart Citation

Scalable Name Lookup for NDN Using Hierarchical Hashing and Patricia Trie

Kim

Shin

2020

Applied Sciences

View full text Add to dashboard Cite

Named data networking (NDN) is a content-centric network for the future of the internet. An NDN a packet is delivered based on a content name instead of a destination IP address. The name lookup for packet forwarding is challenging because the content name is variable, and its space is unbounded. This paper proposes a novel name lookup scheme that employs a hashing technique combined with Patricia tries. In this scheme, hash tables are dynamically maintained according to the hierarchical structure of the name, so the name can effectively accommodate variable and unbounded content names. Unlike chaining, a Patricia trie compares a key string only once at a leaf node, so it provides a fast name lookup. The proposed lookup scheme is implemented and evaluated by using an Intel Core i7-2600 CPU and 4GB of memory. Experimental results show that our scheme gives good scalability and a high throughput of name lookup with a controlled memory consumption.

show abstract

“…Most previously proposed name lookup schemes can be classified into TCAM-based [11], trie-based [12][13][14][15], and hash-based [16][17][18][19][20][21] ones.…”

Section: Related Workmentioning

confidence: 99%

“…Because a name may be a long string of characters, name lookup may need more memory accesses in a trie than an IP lookup. Lee et al tried to decrease that by path compression [12]. In [13], Li et al proposed port information assist trie (P-trie) to prune subtries based on output interface information.…”

Section: Related Workmentioning

confidence: 99%

Scalable Name Lookup for NDN Using Hierarchical Hashing and Patricia Trie

Kim

Shin

2020

Applied Sciences

View full text Add to dashboard Cite

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%

“…Similarly, a name is hierarchically composed of components in NDN. For this reason, several trie-based name lookup techniques were researched [4][5][6][7][8]. Those techniques primarily focused on reducing the average number of memory accesses per lookup to speed up the name lookup.…”

Section: Introductionmentioning

confidence: 99%

Route Prefix Caching Using Bloom Filters in Named Data Networking

Kim

Shin

2020

Applied Sciences

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

“…The name component encoding (NCE) scheme [19] has been proposed to resolve the irregularity of the component length by encoding one component as a unique integer. Several trie-based name lookup techniques have been proposed to reduce the actual number of memory accesses per lookup using parallelization [18], path compression [7], and pruning sub-tries [9].…”

Section: Packet Forwarding In Ndnmentioning

confidence: 99%

An Efficient Prefix Caching Scheme for Fast Forwarding in Named Data Networking

Kim¹

2019

STUD INFORM CONTROL

View full text Add to dashboard Cite

Named data networking (NDN) has recently received much attention as a promising structure for informationcentric networking. The name lookup in NDN is a fairly complicated process because of the unbounded name space and its variable string matching characteristics. This paper proposes a prefix caching scheme for fast name lookup in the forwarding information base (FIB) of NDN. It is based on the critical distance that is the longest distance between a prefix and its child prefixes. Caching a non-leaf prefix can lead to incorrect lookup results. In the proposed scheme the non-leaf prefix is expanded for caching based on the critical distance to avoid such incorrect results. This scheme can be applied to any kind of underlying FIB to employ the spatial locality. We also simulate and evaluate our scheme in comparison with other schemes. Experiment results show that our scheme has a higher cache hit ratio than other schemes.

show abstract

A new name prefix trie with path compression

Cited by 10 publications

References 6 publications

Scalable Name Lookup for NDN Using Hierarchical Hashing and Patricia Trie

Scalable Name Lookup for NDN Using Hierarchical Hashing and Patricia Trie

Route Prefix Caching Using Bloom Filters in Named Data Networking

An Efficient Prefix Caching Scheme for Fast Forwarding in Named Data Networking

Contact Info

Product

Resources

About