A two-layer intra-domain routing scheme for named data networking

Author(s):  
Huichen Dai ◽  
Jianyuan Lu ◽  
Yi Wang ◽  
Bin Liu
Author(s):  
João Vitor Torres ◽  
Igor Drummond Alvarenga ◽  
Raouf Boutaba ◽  
Otto Carlos Muniz Bandeira Duarte

Abstract The huge amount of content names available in Named-Data Networking (NDN) challenges both the required routing table size and the techniques for locating and forwarding information. Content copies and content mobility exacerbate the scalability challenge to reach content in the new locations. We present and analyze the performance of a proposed Controller-based Routing Scheme, named CRoS-NDN, which preserves NDN features using the same interest and data packets. CRoS-NDN supports content mobility and provides fast content recovery from copies that do not belong to the consumer-producer path because it splits identity from location without incurring FIB size explosion or supposing prefix aggregation. It provides features similar to Content Distribution Networks (CDN) in NDN, and improves the routing efficiency. We compare our proposal with similar routing protocols and derive analytical expressions for lower-bound efficiency and upper-bound latency. We also conduct extensive simulations to evaluate results in data delivery efficiency and delay. The results show the robust behavior of the proposed scheme achieving the best efficiency and delay performance for a wide range of scenarios. Furthermore, CRoS-NDN results in low use of processing time and memory for a growing number of prefixes.


2021 ◽  
Vol 2021 ◽  
pp. 1-13
Author(s):  
Hao Liu ◽  
Rongbo Zhu ◽  
Jun Wang ◽  
Wengang Xu

Due to the distributed and dynamic characteristics of the Internet of Vehicles (IoV) and the continuous growth in the number of devices, content-centric decentralized vehicular named data networking (VNDN) has become more suitable for content-oriented applications in IoV. However, the existing centralized architecture is prone to the failure of single points, which results in trust problems in key verification between cross-domain nodes and consuming more power and reducing the lifetime. Focusing on secure key management and power-efficient routing, this article proposes a blockchain-based key management and green routing scheme for VNDN. A blockchain-based key management scheme is presented to achieve secure and efficient distribution and verification of keys. Specifically, all trusted agencies (TAs) form a consortium blockchain for storing public key hashes to ensure the authenticity of users’ public keys. A green global routing scheme based on node relaying pressure (GGNRP) is proposed to save power consumption and reduce the forwarding delay. A new node relay pressure metric is introduced to assist with routing decisions. Detailed experiments and analysis show that, compared with the existing scheme, the proposed scheme can achieve secure key management and GGNRP can decrease the power consumption and average delay by 15.8% and 63.2%, respectively.


2013 ◽  
Author(s):  
Charles Duan ◽  
Cynthia Grady ◽  
Paul Ohm ◽  
James Grimmelmann

Author(s):  
Rui Hou ◽  
Shuo Zhou ◽  
Mengtian Cui ◽  
Lingyun Zhou ◽  
Deze Zeng ◽  
...  

2021 ◽  
Vol 11 (9) ◽  
pp. 4064
Author(s):  
Muktar Hussaini ◽  
Muhammad Ali Naeem ◽  
Byung-Seo Kim

Named data networking (NDN) is designed as a clean-slate Internet architecture to replace the current IP Internet architecture. The named data networking was proposed to offer vast advantages, especially with the advent of new content distributions in IoT, 5G and vehicular networking. However, the architecture is still facing challenges for managing content producer mobility. Despite the efforts of many researchers that curtailed the high handoff latency and signaling overhead, there are still some prominent challenges, such as non-optimal routing path, long delay for data delivery and unnecessary interest packet losses. This paper proposed a solution to minimize unnecessary interest packet losses, delay and provide data path optimization when the mobile producer relocates by using mobility update, broadcasting and best route strategies. The proposed solution is implemented, evaluated and benchmarked with an existing Kite solution. The performance analysis result revealed that our proposed Optimal Producer Mobility Support Solution (OPMSS) minimizes the number of unnecessary interest packets lost on average by 30%, and an average delay of 25% to 30%, with almost equal and acceptable signaling overhead costs. Furthermore, it provides a better data packet delivery route than the Kite solution.


Sign in / Sign up

Export Citation Format

Share Document