An Entropy-Based Approach: Compressing Names for NDN Lookup
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 con...
Main Authors: | Tianyuan Niu, Fan Yang |
---|---|
Format: | Article |
Language: | English |
Published: |
IEEE
2021-01-01
|
Series: | IEEE Access |
Subjects: | |
Online Access: | https://ieeexplore.ieee.org/document/9502705/ |
Similar Items
-
Scalable Name Lookup for NDN Using Hierarchical Hashing and Patricia Trie
by: Junghwan Kim, et al.
Published: (2020-02-01) -
Name Lookup in Named Data Networking: A Review
by: Al-qutwani Majed, et al.
Published: (2019-02-01) -
Route Prefix Caching Using Bloom Filters in Named Data Networking
by: Junghwan Kim, et al.
Published: (2020-03-01) -
A PEKS-Based NDN Strategy for Name Privacy
by: Kyi Thar Ko, et al.
Published: (2020-07-01) -
IP routing lookup: hardware and software approach
by: Chakaravarthy, Ravikumar V.
Published: (2005)