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: | , |
---|---|
Format: | Article |
Language: | English |
Published: |
IEEE
2021-01-01
|
Series: | IEEE Access |
Subjects: | |
Online Access: | https://ieeexplore.ieee.org/document/9502705/ |
id |
doaj-5ddb974af1674f24a6fc55d06a86377e |
---|---|
record_format |
Article |
spelling |
doaj-5ddb974af1674f24a6fc55d06a86377e2021-08-10T23:00:26ZengIEEEIEEE Access2169-35362021-01-01910983310984610.1109/ACCESS.2021.31015789502705An Entropy-Based Approach: Compressing Names for NDN LookupTianyuan Niu0https://orcid.org/0000-0002-6615-0453Fan Yang1https://orcid.org/0000-0002-0732-2462State Key Laboratory of Networking and Switching Technology, Beijing University of Posts and Telecommunications, Beijing, ChinaState Key Laboratory of Networking and Switching Technology, Beijing University of Posts and Telecommunications, Beijing, ChinaNDN (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.https://ieeexplore.ieee.org/document/9502705/Named Data Networkinglookup algorithms |
collection |
DOAJ |
language |
English |
format |
Article |
sources |
DOAJ |
author |
Tianyuan Niu Fan Yang |
spellingShingle |
Tianyuan Niu Fan Yang An Entropy-Based Approach: Compressing Names for NDN Lookup IEEE Access Named Data Networking lookup algorithms |
author_facet |
Tianyuan Niu Fan Yang |
author_sort |
Tianyuan Niu |
title |
An Entropy-Based Approach: Compressing Names for NDN Lookup |
title_short |
An Entropy-Based Approach: Compressing Names for NDN Lookup |
title_full |
An Entropy-Based Approach: Compressing Names for NDN Lookup |
title_fullStr |
An Entropy-Based Approach: Compressing Names for NDN Lookup |
title_full_unstemmed |
An Entropy-Based Approach: Compressing Names for NDN Lookup |
title_sort |
entropy-based approach: compressing names for ndn lookup |
publisher |
IEEE |
series |
IEEE Access |
issn |
2169-3536 |
publishDate |
2021-01-01 |
description |
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. |
topic |
Named Data Networking lookup algorithms |
url |
https://ieeexplore.ieee.org/document/9502705/ |
work_keys_str_mv |
AT tianyuanniu anentropybasedapproachcompressingnamesforndnlookup AT fanyang anentropybasedapproachcompressingnamesforndnlookup AT tianyuanniu entropybasedapproachcompressingnamesforndnlookup AT fanyang entropybasedapproachcompressingnamesforndnlookup |
_version_ |
1721211767079567360 |