Search

Information-Centric Networking (ICN) is promising system architecture for distributing popular information across the network. Its important feature is the node cache. ICN with caching is a very promising featured network structural design. There are numerous cache nodes distributed in the ICN. Excessive consumption of cache information on a tremendous number of nodes dissipates a large storage space and causes data redundancy, which reduces the cache hit rate. Therefore, an efficient caching deployment approach is required to improve the cache hit rate. A novel RAndom probit regressive Bucklin DEcision Forest classifier (RADEF) technique is introduced in Information-Centric Networking (ICN) for minimal network latency and higher cache hit rate. In RADEF Technique, probit regression and random forest classification processes are carried out for ICN with healthcare patient data. First, the patient information is collected from different IoT devices and registered. Every request to the router node is analyzed in the content storage (CS) by using a random probit regressive Bucklin decision forest classifier. The Bucklin decision forest classifier is an ensemble technique that includes a set of weak learners as decision trees (i.e., probit regression tree) and IoHT data are selected randomly for each decision tree. The Probit regression tree is constructed to analyze the patient healthcare data request search in the content storage (CS) of the router node in the ICN network by using a simple matching coefficient. If the copy is present in the content storage, the particular router nodes are chosen and deliver the content. If the copy is absent, the patient information is stored in the cache. Then, the weak learner's results are combined to make a strong output. Then the votes are generated for each decision tree. The votes of all decision trees are combined to identify the majority votes of data for classification by minimizing the error using the Bucklin voting method. In this way, content catching is effectively performed in ICN with minimum latency and a higher cache hit ratio. Experimental evaluation is carried out on factors such as cache hit rate, network latency, average request length, average response time, server traffic ratio, and hop reduction ratio regarding respect to the number of patient healthcare data. The analyzed results demonstrate the superior performance of our proposed RADEF technique when compared with existing methods. [ABSTRACT FROM AUTHOR]

Information-Centric Networking (ICN) is a new paradigm of network architecture that focuses on content rather than hosts as first-class citizens of the network. As part of these architectures, in-network storage devices are essential to provide end users with close copies of popular content, to reduce latency and improve the overall experience for the user but also to reduce network congestion and load on the content producers. To be effective, in-network storage devices, such as content storage routers, should maintain copies of the most popular content objects. Adversaries that wish to reduce this effectiveness can launch cache pollution attacks to eliminate the benefit of the in-network storage device caches. Therefore, it is crucial to protect these devices and ensure the highest hit rate possible. This paper demonstrates Per-Face Popularity approaches to reducing the effects of cache pollution and improving hit rates by normalizing assessed popularity across all faces of content storage routers. The mechanisms that were developed prevent consumers, whether legitimate or malicious, on any single face or small number of faces from overwhelmingly influencing the content objects that remain in the cache. The results demonstrate that per-face approaches generally have much better hit rates than currently used cache replacement techniques.

Information-Centric Networking (ICN) is a new paradigm of network architecture that focuses on content rather than hosts as first-class citizens of the network. As part of these architectures, in-network storage devices are essential to provide end users with close copies of popular content, to reduce latency and improve the overall experience for the user but also to reduce network congestion and load on the content producers. To be effective, in-network storage devices, such as content storage routers, should maintain copies of the most popular content objects. Adversaries that wish to reduce this effectiveness can launch cache pollution attacks to eliminate the benefit of the in-network storage device caches. Therefore, it is crucial to protect these devices and ensure the highest hit rate possible. This paper demonstrates Per-Face Popularity approaches to reducing the effects of cache pollution and improving hit rates by normalizing assessed popularity across all faces of content storage routers. The mechanisms that were developed prevent consumers, whether legitimate or malicious, on any single face or small number of faces from overwhelmingly influencing the content objects that remain in the cache. The results demonstrate that per-face approaches generally have much better hit rates than currently used cache replacement techniques. [ABSTRACT FROM AUTHOR]

Information-Centric Networking (ICN) and Software-Defined Networking (SDN) are both new evolving network architectures that are receiving a lot of attention from researchers. ICN is a Future Internet architecture which tries to transform the current Internet architecture from location- and host-centric to content-centric, where obtaining requested data is achieved by the contents' names regardless of the location of the data. From another angle, SDN is considered a new Internet architecture that moves the control plane management from network devices to a centralized controller. The SDN controller enhances network robustness and improves its scalability, reliability, and flexibility. The integration of ICN and SDN results in massive benefits, where SDN enhances ICN networks' manageability, controllability, and functionality, and ICN reshapes the SDN design to make it compatible with ICN features and to enhance ICN in terms of network caching, routing, mobility, and security.. In this review paper, a comprehensive survey of the issues and challenges of integrating ICN and SDN is presented. Firstly, ICN's main characteristics are summarized, and a short comparison between different ICN architectures is completed. Then, the key details of SDN are highlighted. Moreover, the motivation and benefits of merging ICN with SDN are summarized and the state-of-the-art work on merging ICN and SDN is reviewed and classified from several aspects. Finally, several open research issues are highlighted. [ABSTRACT FROM AUTHOR]

Multi-access Edge Computing (MEC) is a novel edge computing paradigm that moves cloudbased processing and storage capabilities closer to mobile users by implementing server resources in the access nodes. MEC helps fulfill the stringent requirements of 5G and beyond networks to offer anytimeanywhere connectivity for many devices with ultra-low delay and huge bandwidths. Information-Centric Networking (ICN) is another prominent network technology that builds on a content-centric network architecture to overcome host-centric routing/operation shortcomings and to realize efficient pervasive and ubiquitous networking. It is envisaged to be employed in Future Internet including Beyond 5G (B5G) networks. The consolidation of ICN with MEC technology offers new opportunities to realize that vision and serve advanced use cases. However, various integration challenges are yet to be addressed to enable the wide-scale co-deployment of ICN with MEC in future networks. In this paper, we discuss and elaborate on ICN MEC integration to provide a comprehensive survey with a forward-looking perspective for B5G networks. In that regard, we deduce lessons learned from related works (for both 5G and B5G networks). We present ongoing standardization activities to highlight practical implications of such efforts. Moreover, we render key B5G use cases and highlight the role for ICN MEC integration for addressing their requirements. Finally, we layout research challenges and identify potential research directions. For this last contribution, we also provide a mapping of the latter to ICN integration challenges and use cases.

Summary: Named data networking (NDN) is gaining momentum as a future Internet architecture. NDN is a type of information‐centric networking (ICN) that attempts to change the current Internet architecture from host/location‐centric to content‐centric, where data retrieving is done by the names of the contents irrespective of the location of the data. A mechanism to advertise the name‐based prefixes between different domains is necessary to accelerate the NDN deployment. In IP‐based routing, border gateway protocol (BGP) is the de facto inter‐domain routing protocol that plays a vital role in Internet communication by enabling different Internet domains to exchange routing information. In its current form, BGP can advertise and process IP‐based prefixes, but it cannot advertise or process NDN name‐based prefixes. Accordingly, BGP needs to be extended to support NDN technology. This paper proposes an NDN extension for BGP, referred to as N‐BGP, that offers a solution to exchange name‐based routes in the current BGP networks. This proposed extension modifies the traditional BGP speaker into a hybrid one. This hybrid speaker is qualified to understand, advertise, receive, process, and store both IP‐based and name‐based routes simultaneously and efficiently, without disturbing or breaking the current Internet operation; that is, it can coexist along with traditional speakers. We also validate and evaluate our proposed solution in a hybrid environment, and the results show that N‐BGP has the capability to exchange and process both Name and IP‐based routes efficiently. [ABSTRACT FROM AUTHOR]

The low earth orbit (LEO) mega constellation for the internet of thing (IoT) has become one of the hot spots for B5G and 6G concerns. Information-centric networking (ICN) provides a new approach to the interconnection of everything in the LEO mega constellation. In ICN, data objects are independent of location, application, storage and transport methods. Therefore, data naming is one of the fundamental issues of ICN, and research on the data naming mechanism of the LEO mega constellation for the IoT is thus the focus of this study. Adopting a fusion of hierarchical, multicomponent, and hash flat as one structure, a data naming mechanism is proposed, which can meet the needs of the IoT multiservice attributes and high-performance transmission. Additionally, prefix tokens are used to describe hierarchical names with various embedded semantic functions to support multisource content retrieval for in-network functions. To verify the performance of the proposed data naming mechanism, an NS-3-based simulation platform for LEO mega constellations for the IoT is designed and developed. The test simulation results show that, compared with the IP address, the ICN-HMcH naming mechanism can increase throughput by as much as 54% and reduce the transmission delay of the LEO mega satellites for the IoT by 53.97%. The proposed data naming mechanism can provide high quality of service (QoS) transmission performance for the LEO mega constellation for IoT and performs better than IP-based transmission. [ABSTRACT FROM AUTHOR]

The domain of information-centric networking (ICN) is expanding as more devices are becoming a part of connected technologies. New methods for serving content from a producer to a consumer are being explored, and Named Data Networking (NDN) is one of them. The NDN protocol routes the content from a producer to a consumer in a network using content names, instead of IP addresses. This facility, combined with content caching, efficiently serves content for very large networks consisting of a hybrid and ad hoc topology with both wired and wireless media. This paper addresses the issue of the quality-of-service (QoS) dimension for content delivery in NDN-based networks. The Internet Engineering Task Force (IETF) classifies QoS traffic as (prompt, reliable), prompt, reliable, and regular, and assigns corresponding priorities for managing the content. QoS-linked privileged content caching (QLPCC) proposes strategies for Pending Interest Table (PIT) and content store (CS) management in dedicated QoS nodes for handling priority content. QoS nodes are intermediately resourceful NDN nodes between content producers and consumers which specifically manage QoS traffic. The results of this study are compared with EQPR, PRR probability cache, and Least Frequently Used (LFU) and Least Fresh First (LFF) schemes, and QLPCC outperformed the latter-mentioned schemes in terms of QoS-node CS size vs. hit rate (6% to 47%), response time vs, QoS-node CS size (65% to 90%), and hop count vs. QoS-node CS size (60% to 84%) from the perspectives of priority traffic and overall traffic. QLPCC performed predictably when the NDN node count was increased from 500 to 1000, showing that the strategy is scalable. [ABSTRACT FROM AUTHOR]

One unique architectural benefit of Named Data Networking (NDN) is adaptive forwarding, i.e., the forwarding plane is able to observe past data retrieval performance and use it to adjust forwarding decisions for future Interests. To be effective, adaptive forwarding assumes that Interest Routing Locality is related to Interests’ common name prefix, meaning that Interests sharing the same prefix are likely to follow a similar forwarding path within a short period of time. Since Interests can have multiple common prefixes with different lengths, the real challenge is determining which prefix length should be used in adaptive forwarding to record path performance measurements - we refer to this as the Prefix Granularity Problem. The longer the common prefix is, the better the Interest Routing Locality, and the larger the forwarding table. Given the limited FIB size, route names are designed to be considerably shorter than Interest names. Existing adaptive forwarding designs use route names to record path performance measurements, which looses forwarding adaptability as it promises in the event of partial network failures. In this work, we propose to dynamically aggregate and de-aggregate name prefixes in the forwarding table in order to use the prefixes that are the most appropriate given current network situation. In addition, to reduce the overhead of adaptive forwarding, we propose mechanisms to minimize the use of the longest prefix matching in Data packet processing. Simulations demonstrate that the proposed techniques can result in better forwarding decisions in the event of partial network failures with significantly reduced overhead. [ABSTRACT FROM AUTHOR]

Information-Centric Networking (ICN) emerges as a promising architecture for the future Internet to keep up with the tremendous growth of Internet users and the explosive increase of mobile data traffic. ICN can be coupled with Disruption Tolerant Networking (DTN) to overcome the limitations of the current Internet architecture in some challenging environments where we cannot establish a network connection, and also lighten the load on the Internet backhaul. Unfortunately, resources constraints, such as energy and buffer space, are among the most serious issues in Mobile Information-Centric Disruption Tolerant Networking (MICDTN). In this paper, we introduce an opportunistic DTN-based forwarding mechanism of Interest and Data for ICN, named Fast-MICDTN. The propagation of the content have been modeled using Markov-Decision Process (MDP). Hence, we characterize the living period in transit of the content to reach the maximum possible number of mobiles. Through extensive simulations based on synthetic mobility model and real-world traces, we prove the efficiency of the new approach in sharing content within a large number of users under a low cost. [ABSTRACT FROM AUTHOR]

The low earth orbit (LEO) mega constellation for the internet of thing (IoT) has become one of the hot spots for B5G and 6G concerns. Information-centric networking (ICN) provides a new approach to the interconnection of everything in the LEO mega constellation. In ICN, data objects are independent of location, application, storage and transport methods. Therefore, data naming is one of the fundamental issues of ICN, and research on the data naming mechanism of the LEO mega constellation for the IoT is thus the focus of this study. Adopting a fusion of hierarchical, multicomponent, and hash flat as one structure, a data naming mechanism is proposed, which can meet the needs of the IoT multiservice attributes and high-performance transmission. Additionally, prefix tokens are used to describe hierarchical names with various embedded semantic functions to support multisource content retrieval for in-network functions. To verify the performance of the proposed data naming mechanism, an NS-3-based simulation platform for LEO mega constellations for the IoT is designed and developed. The test simulation results show that, compared with the IP address, the ICN-HMcH naming mechanism can increase throughput by as much as 54% and reduce the transmission delay of the LEO mega satellites for the IoT by 53.97%. The proposed data naming mechanism can provide high quality of service (QoS) transmission performance for the LEO mega constellation for IoT and performs better than IP-based transmission.

The domain of information-centric networking (ICN) is expanding as more devices are becoming a part of connected technologies. New methods for serving content from a producer to a consumer are being explored, and Named Data Networking (NDN) is one of them. The NDN protocol routes the content from a producer to a consumer in a network using content names, instead of IP addresses. This facility, combined with content caching, efficiently serves content for very large networks consisting of a hybrid and ad hoc topology with both wired and wireless media. This paper addresses the issue of the quality-of-service (QoS) dimension for content delivery in NDN-based networks. The Internet Engineering Task Force (IETF) classifies QoS traffic as (prompt, reliable), prompt, reliable, and regular, and assigns corresponding priorities for managing the content. QoS-linked privileged content caching (QLPCC) proposes strategies for Pending Interest Table (PIT) and content store (CS) management in dedicated QoS nodes for handling priority content. QoS nodes are intermediately resourceful NDN nodes between content producers and consumers which specifically manage QoS traffic. The results of this study are compared with EQPR, PRR probability cache, and Least Frequently Used (LFU) and Least Fresh First (LFF) schemes, and QLPCC outperformed the latter-mentioned schemes in terms of QoS-node CS size vs. hit rate (6% to 47%), response time vs, QoS-node CS size (65% to 90%), and hop count vs. QoS-node CS size (60% to 84%) from the perspectives of priority traffic and overall traffic. QLPCC performed predictably when the NDN node count was increased from 500 to 1000, showing that the strategy is scalable.

In this paper, we propose an enhanced request adaptive (EReA) scheme for content service provision in dynamic information-centric vehicular networking (ICVN) environment. The EReA scheme manages the cache update at the roadside units (RSUs) and provides low-latency content delivery to the end-users. User requests trigger the cache update at the RSU for a particular content item on the basis of its u p d a t e − p r o b a b i l i t y. We introduce an additional parameter t o l e r a n c e i for each content item i. This parameter suppresses the frequency of content updates triggers at the RSU cache during high network load for the non-critical contents. This provides an additional saving in bandwidth. The simulation setup is created by ndnSIM 2.0 to validate the performance of this proposed scheme. The working and performance of the other content delivery schemes are also discussed in details. Results show that the proposed scheme provides a better hit-ratio compared to the existing ReA scheme under high network load, which results in an additional saving in bandwidth. Additionally, it also inherits the advantages of the ReA scheme. [ABSTRACT FROM AUTHOR]