Named Data Networking Caching Research Articles

Provisioning of Fog Computing over Named-Data Networking in Dynamic Wireless Mesh Systems.

Fog computing is today considered a promising candidate to improve the user experience in dynamic on-demand computing services. However, its ubiquitous application would require support for this service in wireless multi-hop mesh systems, where the use of conventional IP-based solutions is challenging. As a complementary solution, in this paper, we consider a Named-Data Networking (NDN) approach to enable fog computing services in autonomous dynamic mesh formations. In particular, we jointly implement two critical mechanisms required to extend the NDN-based fog computing architecture to wireless mesh systems. These are (i) dynamic face management systems and (ii) a learning-based route discovery strategy. The former makes it possible to solve NDN issues related to an inability to operate over a broadcast medium. Also, it improves the data-link layer reliability by enabling unicast communications between mesh nodes. The learning-based forwarding strategy, on the other hand, efficiently reduces the amount of overhead needed to find routes in the dynamically changing mesh networks. Our numerical results show that, for static wireless meshes, our proposal makes it possible to fully benefit from the computing resources sporadically available up to several hops away from the consumer. Additionally, we investigate the impacts of various traffic types and NDN caching capabilities, revealing that the latter result in much better system performance while the popularity of the compute service contributes to additional performance gains.

An NDN Cache-Optimization Strategy Based on Dynamic Popularity and Replacement Value

Aiming at examining the problems of the low cache hit ratio and high-average routing hops in named data networking (NDN), this paper proposes a cache-optimization strategy based on dynamic popularity and replacement value. When the requested content arrives at the routing node, the latest popularity is calculated based on the number of requests in the current cycle and the popularity of the previous cycle. We adjust the node cache threshold according to the occupation of the node cache space and cache the content with a higher popularity than the threshold. When the cache is complete, the cache-optimization strategy considers the last request time, popularity, and transmission cost of cached content to calculate the replacement value of cached content. We move the content with the lowest replacement value out of the cache, and keep the content with a high replacement value. We deploy the proposed cache-optimization strategy by using a programmable language in a real network with programmable devices. The experimental results illustrate that the strategy proposed in this paper can effectively improve the cache hit ratio and reduce the average routing hops for user request responses compared with other traditional NDN caching strategies.

Context-based caching in mobile information-centric networks

Wireless networking is expected to sustain the direct interaction between personal users’ devices, and to provide connectivity on large-scale resource-constrained devices. However, conventional networking protocols fail in large scale mobile wireless environments, due to node mobility, dynamic topologies, and intermittent connectivity. Information-Centric Networking (ICN) has been considered the most promising candidate to overcome the drawbacks of host-centric architectures where Named Data Networking (NDN) is one of the well-known and studied architectures within the ICN paradigm.The main objective of this work is to improve both content availability and network performance in mobile environments regarding the ICN paradigm. This is provided through a context-based approach for the caching admission policy providing in-network caching and content replication, facilitating the efficient and timely delivery of information. Content popularity, freshness, proximity, source mobility type and network density are some of the metrics considered in the caching decision. We conducted a comparative study between our proposal and the NDN caching strategy by using two different datasets with real mobility and connectivity traces, addressing intermittent communication. According to our results, we observed that using a multi-criteria context-based cache admission policy improves cache hits, cache evictions, and request satisfaction ratios in mobile environments, thus improving content delivery and network efficiency.

NDN-based IoT with Edge computing

The Internet of Things (IoT) consists of smart devices that can capture and sense real-time information for monitoring. IoT is typically applied in some delay-sensitive fields, so it is significant to achieve efficient IoT-based data communications. IoT works based on the IP-based end-to-end data delivery mechanism, but this end-to-end mechanism is inefficient in the IoT scenarios. The Named Data Networking (NDN) is a new data communication paradigm and its advantages might help improve IoT-based data communication efficiency. However, IoT and NDN have different architectures and IoT devices have limited resources, so it is hard to directly deploy NDN in IoT. To exploit the advantages of NDN to improve IoT-based data communication efficiency, we are motivated to integrate IoT with Edge computing and clustering (IoTE) so that edge devices and cluster heads can help achieve request aggregation and in-network caching in NDN. Based on the idea, we propose an NDN-based IoTE (NIoTE) framework so that IoT devices can employ the advantages of NDN to retrieve data from the nearest provider via one data communication process. The experimental results verify the advantages of NIoTE, and demonstrate that NIoTE effectively decreases data communication latency and costs.

EHCP: An Efficient Hybrid Content Placement Strategy in Named Data Network Caching

The abilities of in-network caching in Named Data Networking (NDN) agrees to enable effective data dissemination throughout the globe without requiring the end-to-end communication infrastructure. The goal of this study is to develop an efficient content placement strategy for the NDN caching module to achieve the enhanced performance for the NDN network. In this work, optimizations of the problems in NDN-based caching strategies are formulated and to solve these problems, a new caching strategy is designed Named as Efficient Hybrid Content Placement (EHCP). The aim of the EHPC strategy is to reduce the multiple replications of homogeneous contents at numerous locations during data dissemination and to increase the diverse number of contents along the data delivery path. In addition, the effect of the cache-hit ratio, hop-decrement, and content redundancy is shown by comparing the proposed caching strategy with other state-of-the-art caching strategies in a simulation environment. The consequences show that the proposed strategy delivers an enhanced number of heterogeneous contents in terms of improving content diversity ratio along with the higher cache-hit ratio. Moreover, with different cache sizes, EHCP performs better in terms of content redundancy and hop-decrement as compared to the existing state-of-the-art strategies.

Joint Incentive Mechanism for Paid Content Caching and Price Based Cache Replacement Policy in Named Data Networking

Internet traffic volume is continuing to increase rapidly. Named data networking (NDN) has been introduced to support this Internet traffic growth through caching contents close to consumers. While caching in NDN is beneficial to both Internet service providers (ISPs) and content providers (CPs), ISPs serve cached contents independently without any coordination with CPs. By authorizing the ISPs to cache and distribute the contents accessible on payments, it becomes impractical for CPs to control content access and payments. In this paper, we address these challenges by proposing a joint incentive mechanism and a price-based cache replacement (PBCR) policy for paid content in NDN that improves the ISP’s and CPs’ profits. We use an auction theory, where the ISP earns profits from caching by alleviating traffic load on transit links and participating in contents selling. Therefore, before the ISP starts selling cached contents, it needs to cache them first. Furthermore, the ISP cache capacity is limited; therefore, we propose PBCR, where the PBCR triggers the content that needs to be replaced when the cache storage is full based on both content price and link cost. The simulation results show that our proposal increases the profits of all the network players involved in paid content caching and improves cache hit ratio.

Efficient Producer Mobility Support in Named Data Networking

Named Data Networking (NDN) is a promising architecture for the future Internet and it is mainly designed for efficient content delivery and retrieval. However, producer mobility support is one of the challenging problems of NDN. This paper proposes a scheme which aims to optimize the tunneling-based producer mobility solution in NDN. It does not require NDN routers to change their routing tables (Forwarding Information Base) after a producer moves. Instead, the Interest packet can be sent from a consumer to the moved producer using the tunnel. The piggybacked Data packet which is sent back to the consumer will trigger the consumer to send the following Interest packets through the optimized path to the producer. Moreover, a naming scheme is proposed so that the NDN caching function can be fully utilized. An analysis is carried out to evaluate the performance of the proposal. The results indicate that the proposed scheme reduces the network cost compared to related works and supports route optimization for enhanced producer mobility support in NDN.

Differentiated forwarding and caching in named-data networking

Named-data networking (NDN) is designed to provide scalable and efficient content delivery, particularly for reducing redundant data transmission. To make the usefulness of NDN more widespread, however, it should support various types of traffic and their quality of Service (QoS) requirements. In this paper, we propose a differentiated services (diffserv) model for NDN. For scalability, the proposed diffserv model is designed to follow the guidelines from the diffserv model in the current Internet. Traffic classification and packet marking are performed at edge routers, and class-based service differentiation is provided by core routers. The proposed model is also considered to take the advantages of NDN unique features such as interest aggregation and in-network caching. We implement our model on the NDN module in ns3, and show the effectiveness of NDN diffserv through extensive simulations.