Evaluating CRoS-NDN: a comparative performance analysis of a controller-based routing scheme for named-data networking

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.

Download Full-text

Optimal Broadcast Strategy-Based Producer Mobility Support Scheme for Named Data Networking

International Journal of Interactive Mobile Technologies (iJIM) ◽

10.3991/ijim.v13i04.10513 ◽

2019 ◽

Vol 13 (04) ◽

pp. 4

Author(s):

Muktar Hussaini ◽

Shahrudin Awang Nor ◽

Amran Ahmad

Keyword(s):

Analytical Investigation ◽

Named Data Networking ◽

Mobility Support ◽

Overhead Cost ◽

Data Packets ◽

Signaling Overhead ◽

Signaling Cost ◽

Handoff Latency ◽

Mobile Consumer ◽

Data Networking

<p>Named Data Networking is a consumer-driven network that supports content consumer mobility due to the nature of in-network catching. The catching suppressed unnecessary Interest packets losses by providing an immediate copy of the data and consumer-driven nature influencedthe mobile consumer to resend unsatisfied Interest packet immediately after the handoff. Once the producer moves to a new location, the name prefix changed automatically after handoff to the new router or point of attachment. The entire network lacks the knowledge of producer movement unless if the producer announces its new prefix to update the FIBs of intermediate routers. Lack of producer’s movement knowledge causes an increase of handoff latency, signaling overhead cost, Interests packets losses, poor utilization of bandwidth and packets delivery. Therefore, there is needs to provide substantial producer mobility support to minimize the handoff latency, handoff signaling overhead cost, reduce the unnecessary Interest packets loss to improve data packets delivery once a content producer relocated. In this paper, broadcasting strategy is introduced to facilitate the handoff procedures and update the intermediate routers about the producer movement. Hence, analytical investigation result of this paper addresses the deficiency of Kite scheme by minimizing handoff signaling cost and provides data path optimization after the handoff.<strong></strong></p>

Download Full-text

A Comparative Performance Analysis of Popularity-Based Caching Strategies in Named Data Networking

IEEE Access ◽

10.1109/access.2020.2980385 ◽

2020 ◽

Vol 8 ◽

pp. 50057-50077 ◽

Cited By ~ 8

Author(s):

Muhammad Ali Naeem ◽

Muhammad Atif Ur Rehman ◽

Rehmat Ullah ◽

Byung-Seo Kim

Keyword(s):

Performance Analysis ◽

Named Data Networking ◽

Comparative Performance ◽

Caching Strategies ◽

Data Networking

Download Full-text

A Literature Review on Caching Transient Contents in Vehicular Named Data Networking

Telecom ◽

10.3390/telecom2010006 ◽

2021 ◽

Vol 2 (1) ◽

pp. 75-92

Author(s):

Marica Amadeo

Keyword(s):

Network Performance ◽

Vehicular Networks ◽

Road Traffic ◽

Named Data Networking ◽

Data Packets ◽

Large Sets ◽

Research Perspectives ◽

Static Data ◽

Parking Lot ◽

Data Networking

Vehicular Named Data Networking (VNDN) is a revolutionary information-centric architecture specifically conceived for vehicular networks and characterized by name-based forwarding and in-network caching. So far, a variety of caching schemes have been proposed for VNDN that work in presence of static Data packets, like traditional Internet contents. However, with the advent of Internet of Things (IoT) and Internet of Vehicles (IoV) applications, large sets of vehicular contents are expected to be transient, i.e., they are characterized by a limited lifetime and become invalid after the latter expires. This is the case of information related to road traffic or parking lot availability, which can change after a few minutes—or even after a few seconds—it has been generated at the source. The transiency of contents may highly influence the network performance, including the gain of in-network caching. Therefore, in this paper, we consider the dissemination of transient contents in vehicular networks and its effects on VNDN caching. By providing a detailed review of related work, we identify the main challenges and objectives when caching transient contents, e.g., to avoid cache inconsistency, to minimize the Age of Information (AoI) and the retrieval latency, and the main strategies to fulfill them. We scan the existing caching and replacement policies specifically designed for transient contents in VNDN and, finally, we outline interesting research perspectives.

Download Full-text

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

2012 IEEE Global Communications Conference (GLOBECOM) ◽

10.1109/glocom.2012.6503543 ◽

2012 ◽

Author(s):

Huichen Dai ◽

Jianyuan Lu ◽

Yi Wang ◽

Bin Liu

Keyword(s):

Named Data Networking ◽

Routing Scheme ◽

Data Networking

Download Full-text

A Trusted Lightweight Communication Strategy for Flying Named Data Networking

Sensors ◽

10.3390/s18082683 ◽

2018 ◽

Vol 18 (8) ◽

pp. 2683 ◽

Cited By ~ 13

Author(s):

Ezedin Barka ◽

Chaker Kerrache ◽

Rasheed Hussain ◽

Nasreddine Lagraa ◽

Abderrahmane Lakas ◽

...

Keyword(s):

Ad Hoc Network ◽

Ad Hoc ◽

Mobile Ad Hoc Network ◽

Communication Strategy ◽

Named Data Networking ◽

Worst Case ◽

Communication Architecture ◽

Broadcast Storm ◽

Wide Range ◽

Data Networking

Flying Ad hoc Network (FANET) is a new resource-constrained breed and instantiation of Mobile Ad hoc Network (MANET) employing Unmanned Aerial Vehicles (UAVs) as communicating nodes. These latter follow a predefined path called ’mission’ to provide a wide range of applications/services. Without loss of generality, the services and applications offered by the FANET are based on data/content delivery in various forms such as, but not limited to, pictures, video, status, warnings, and so on. Therefore, a content-centric communication mechanism such as Information Centric Networking (ICN) is essential for FANET. ICN addresses the problems of classical TCP/IP-based Internet. To this end, Content-centric networking (CCN), and Named Data Networking (NDN) are two of the most famous and widely-adapted implementations of ICN due to their intrinsic security mechanism and Interest/Data-based communication. To ensure data security, a signature on the contents is appended to each response/data packet in transit. However, trusted communication is of paramount importance and currently lacks in NDN-driven communication. To fill the gaps, in this paper, we propose a novel trust-aware Monitor-based communication architecture for Flying Named Data Networking (FNDN). We first select the monitors based on their trust and stability, which then become responsible for the interest packets dissemination to avoid broadcast storm problem. Once the interest reaches data producer, the data comes back to the requester through the shortest and most trusted path (which is also the same path through which the interest packet arrived at the producer). Simultaneously, the intermediate UAVs choose whether to check the data authenticity or not, following their subjective belief on its producer’s behavior and thus-forth reducing the computation complexity and delay. Simulation results show that our proposal can sustain the vanilla NDN security levels exceeding the 80% dishonesty detection ratio while reducing the generated end-to-end delay to less than 1 s in the worst case and reducing the average consumed energy by more than two times.

Download Full-text

Blockchain-Based Key Management and Green Routing Scheme for Vehicular Named Data Networking

Security and Communication Networks ◽

10.1155/2021/3717702 ◽

2021 ◽

Vol 2021 ◽

pp. 1-13

Author(s):

Hao Liu ◽

Rongbo Zhu ◽

Jun Wang ◽

Wengang Xu

Keyword(s):

Power Consumption ◽

Key Management ◽

Named Data Networking ◽

Average Delay ◽

Continuous Growth ◽

Power Efficient ◽

Routing Scheme ◽

Management Scheme ◽

Green Routing ◽

Data Networking

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.

Download Full-text