An efficient and DoS-resilient name lookup for NDN interest forwarding
As a novel Internet architecture focused on data contents, Named Data Networking (NDN) has been proven to be of great value in supporting the Internet of Things, Edge computing, Blockchain, and other popular topics. They can benefit mainly from NDN's intrinsic properties, such as flexible multi...
Saved in:
| Main Authors: | , , , , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Taylor & Francis Group
2021-07-01
|
| Series: | Connection Science |
| Subjects: | |
| Online Access: | http://dx.doi.org/10.1080/09540091.2021.1875988 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1850232904361181184 |
|---|---|
| author | Dacheng He Dafang Zhang Yanbiao Li Wei Liang Meng-Yen Hsieh |
| author_facet | Dacheng He Dafang Zhang Yanbiao Li Wei Liang Meng-Yen Hsieh |
| author_sort | Dacheng He |
| collection | DOAJ |
| description | As a novel Internet architecture focused on data contents, Named Data Networking (NDN) has been proven to be of great value in supporting the Internet of Things, Edge computing, Blockchain, and other popular topics. They can benefit mainly from NDN's intrinsic properties, such as flexible multicasting, in-network caching, among several others. However, once NDN's forwarding plane suffers Denial of Service (DoS) attacks, the overall system performance would be affected significantly. In NDN data transmission, interest forwarding is the most time-consuming operation and thus opens a possible vector of DoS attacks. It is proposed in this paper a fast name lookup algorithm for NDN interest forwarding, which selects feature prefixes instead of lengths to filter out interest packets in NDN interest forwarding. Due to the excellent filtration with feature prefixes, the algorithm accelerates NDN forwarding processes. Compared with other existing solutions, the proposed algorithm shows more than 70% of time improvement in forwarding malicious interests, while remaining at the same performance level in standard cases. |
| format | Article |
| id | doaj-art-0d402b6b2a304653a4783be1002feee5 |
| institution | OA Journals |
| issn | 0954-0091 1360-0494 |
| language | English |
| publishDate | 2021-07-01 |
| publisher | Taylor & Francis Group |
| record_format | Article |
| series | Connection Science |
| spelling | doaj-art-0d402b6b2a304653a4783be1002feee52025-08-20T02:03:04ZengTaylor & Francis GroupConnection Science0954-00911360-04942021-07-0133373575210.1080/09540091.2021.18759881875988An efficient and DoS-resilient name lookup for NDN interest forwardingDacheng He0Dafang Zhang1Yanbiao Li2Wei Liang3Meng-Yen Hsieh4College of Computer Science and Electronic Engineering, Hunan UniversityCollege of Computer Science and Electronic Engineering, Hunan UniversityComputer Network Information Center, Chinese Academy of SciencesCollege of Computer Science and Electronic Engineering, Hunan UniversityDepartment of Computer Science and Information Engineering, Providence UniversityAs a novel Internet architecture focused on data contents, Named Data Networking (NDN) has been proven to be of great value in supporting the Internet of Things, Edge computing, Blockchain, and other popular topics. They can benefit mainly from NDN's intrinsic properties, such as flexible multicasting, in-network caching, among several others. However, once NDN's forwarding plane suffers Denial of Service (DoS) attacks, the overall system performance would be affected significantly. In NDN data transmission, interest forwarding is the most time-consuming operation and thus opens a possible vector of DoS attacks. It is proposed in this paper a fast name lookup algorithm for NDN interest forwarding, which selects feature prefixes instead of lengths to filter out interest packets in NDN interest forwarding. Due to the excellent filtration with feature prefixes, the algorithm accelerates NDN forwarding processes. Compared with other existing solutions, the proposed algorithm shows more than 70% of time improvement in forwarding malicious interests, while remaining at the same performance level in standard cases.http://dx.doi.org/10.1080/09540091.2021.1875988ndndosname lookupfeature prefixinterest forwarding |
| spellingShingle | Dacheng He Dafang Zhang Yanbiao Li Wei Liang Meng-Yen Hsieh An efficient and DoS-resilient name lookup for NDN interest forwarding Connection Science ndn dos name lookup feature prefix interest forwarding |
| title | An efficient and DoS-resilient name lookup for NDN interest forwarding |
| title_full | An efficient and DoS-resilient name lookup for NDN interest forwarding |
| title_fullStr | An efficient and DoS-resilient name lookup for NDN interest forwarding |
| title_full_unstemmed | An efficient and DoS-resilient name lookup for NDN interest forwarding |
| title_short | An efficient and DoS-resilient name lookup for NDN interest forwarding |
| title_sort | efficient and dos resilient name lookup for ndn interest forwarding |
| topic | ndn dos name lookup feature prefix interest forwarding |
| url | http://dx.doi.org/10.1080/09540091.2021.1875988 |
| work_keys_str_mv | AT dachenghe anefficientanddosresilientnamelookupforndninterestforwarding AT dafangzhang anefficientanddosresilientnamelookupforndninterestforwarding AT yanbiaoli anefficientanddosresilientnamelookupforndninterestforwarding AT weiliang anefficientanddosresilientnamelookupforndninterestforwarding AT mengyenhsieh anefficientanddosresilientnamelookupforndninterestforwarding AT dachenghe efficientanddosresilientnamelookupforndninterestforwarding AT dafangzhang efficientanddosresilientnamelookupforndninterestforwarding AT yanbiaoli efficientanddosresilientnamelookupforndninterestforwarding AT weiliang efficientanddosresilientnamelookupforndninterestforwarding AT mengyenhsieh efficientanddosresilientnamelookupforndninterestforwarding |