A Classification-Based Wisdom Caching scheme for Content Centric Networking

With the development of the mobile Internet in recent years, the amount of data in Internet has increased substantially, resulting in more and more serious delivery delay and data cost surge, which has brought great pressure to traditional host-centered networks. As a result, a new network architecture, Content-Centric Networking (CCN), has emerged. Compared with traditional networks, CCN has larger network capacity and lower delivery delay, which can better improve quality of service. Contents are cached in the routers in a CCN. Thus, when a user’s interest packet is passed to routers, the router that caches the content can directly respond to the request. Efficient caching strategies in CCN can not only reduce link load and storage redundancy, but also reduce delivery delay caused by the surge of data. This chapter studies caching strategies in the CCN. In order to efficiently and reasonably place contents in routers and reduce the transmission delay, it firstly proposes a caching scheme based on on-path caching and off-path caching. Secondly, in order to further reduce the energy consumption, this thesis proposes a caching scheme to minimize energy consumption. In the caching scheme based on the on-path caching and off-path caching, we firstly analyze the factors such as the popularity of contents and the history of user’s requests. Secondly, we strengthen the collaboration and the sharing of caching information between routers. Finally, an optimization problem aiming at minimizing the delivery delay is established, and an approximate algorithm is designed to obtain the approximate solution to the problem. The simulation results show that this scheme can effectively reduce delivery delay. In the caching scheme for minimizing energy consumption, we firstly set up a network content transmission model and a storage model. Secondly, through the comprehensive analysis of the content size and popularity of contents, we design the cache scheme to minimize energy consumption cost in CCN. Then, we transform the caching problem to an energy cost minimization problem, which is subject to certain constraints. Finally, an improved genetic algorithm is used to solve the problem. Simulation results show that the caching scheme to minimize energy consumption can effectively reduce the energy consumption, and it is superior to other caching schemes.KeywordsContent-centric networkingCollaborative cachingEnergy consumption minimizationPopularity

Content Centric Networking (CCN) is an emerging next-generation network infrastructure around content dissemination and retrieval, shifting from physical locations to named data. The built-in caching capacity of CCN, termed as in-network caching, promises to enable fast and effective content distribution at a global scale. Because of the in-network caching, the caching strategy of content location potentially affects how to make content searching decisions, while content searching in return decides in which routers content are stored. The relationship between content caching location and content searching has not been fully exploited in CCN or further used for the whole network performance improvement. This paper exploits the content caching location and content searching mechanism of CCN, and proposes a Popularity-driven content Caching Location and Searching scheme (P-CLS) in CCN. P-CLS leverages content access popularity to realize diverse content distribution and reduce content caching redundancy, which also overcomes the oscillation and frequent replacement phenomenon in the existing content caching and searching (CLS) scheme. Extensive simulations via hierarchical and arbitrary caching topologies show that the proposed scheme outperforms the existing caching algorithms.

Content-Centric network (CCN) provides substantial flexibility for users to obtain information. One of the most important commonalities of CCN designs is the universal caching. It is widely accepted that in-network caching would improve performance. In this paper we propose a cache scheme based on popularity and age aiming at reducing network delay and redundancy. Then we implements the CCN network communication model by simulation. Finally, we verified our scheme has a better performance compared with the traditional caching schemes.

Content Centric Mobile Ad-hoc NETwork (CCMANET) applies the advantages of Content Centric networking (CCN) into Mobile Ad Hoc Network(MANET) to overcome the drawbacks of low efficiency and unstable in transmission. Caching scheme is one of the key components of CCMANET. However, the caching scheme in CCMANET has not been well explored. In this paper, a novel cooperative caching scheme based on generalized dominating set and local content popularity for CCMANET is proposed. First, a virtual backbone in CCMANET is constructed by generalized dominating set to make the arbitrary topology become two-level hierarchy and a collaborative cache placement scheme between the two hierarchies is designed. Second, we propose a method of computing the local content popularity and a cache replacement scheme based on the local content popularity. Simulation results show that the proposed caching scheme can effectively reduces both path stretch value and server load, and improves the hit ratio compared with the existing caching schemes.

Recently, content-centric networking (CCN) has become a hot research topic for the diffusion of contents over the Internet. Most existing works on CCN focus on the improvement of network resource utilization. Consequently, the energy consumption aspect of CCN is largely ignored. In this paper, we propose a distributed energy-efficient in-network caching scheme for CCN, where each content router only needs locally available information to make caching decisions considering both caching energy consumption and transport energy consumption. We formulate the in-network caching problem as a non-cooperative game. Through rigorous mathematical analysis, we prove that pure strategy Nash equilibria exist in the proposed scheme, and it always has a strategy profile that implements the socially optimal configuration, even if the routers are self-interested in nature. Simulation results are presented to show that the distributed solution is competitive to the centralized scheme, and has superior performance compared to other popular caching schemes in CCN. Besides, it exhibits a fast convergence speed when the capacity of content routers varies.

The Internet of Things (IoT) become established as a promising environment, which connects a vast number of physical devices. The rapid increase in the number of IoT devices has imposed many challenges in the Internet Protocol (IP)-based Internet architecture. Towards this, the content-centric networking (CCN) has been realized as the potential Internet architecture in which the contents are accessed using a name-based mechanism. The underlying advantages of CCN that includes in-network caching capabilities and faster data delivery make it the most suitable architecture for latency-sensitive IoT applications. In this paper, the proposed novel content caching scheme efficiently utilizes the available caching resources. The scheme considers the node degree-centrality, hop-based distance and the content access frequency for making content caching decisions. The scheme places the frequently accessed contents on the high degree-centrality routers close to the boundaries of network and improves content availability. Comprehensive simulations on the Abilene network topology with different cache capacities demonstrate the performance improvement of proposed scheme over peer caching schemes. The simulation results are obtained for various performance metrics such as cache hit ratio, average network hop-count and latency parameters. The obtained quality-of-service (QoS) shows that the proposed scheme is suitable for latency-sensitive CCN-based IoT networks.

Content-Centric Networks (CCNs) promise to deliver content in a better way than today's Internet. In CCNs, efficient content delivery services can be achieved by using cache storage on routers. However, an effective caching scheme in CCNs is never established, because the communication method in CCNs differs from that in traditional networks. Therefore, we propose a selective caching scheme which only caches content likely to be used next. Furthermore, we show its effectiveness through simulations.

Content-centric Networking (CCN) is one of the most promising network architectures for the future Internet. In-network caching is an attractive feature of CCN, however, the existing research does not consider the off-path nodes, or gives a large communication overhead for cooperation, which makes the caching utilization lower, and hard to achieve comprehensive performance optimization. To reduce the data redundancy and improve the caching utilization, we propose a Regional Hashing Collaborative Caching Strategy (RHCCS). According to calculate the importance of nodes in the network topology, we divide the network into the core area and edge area. In core area, we select the relevant nodes for cooperation, store the block in the off-path nodes with the hashing algorithm, and add a new table in original data structures for routing in the collaborative areas. As for edge area, we deploy the on-path reversion scheme. By simulating in ndnSIM and comparing with the basic caching strategy in CCN, experimental results indicate that the RHCCS can effectively reduce data redundancy, routing hops, requesting delay, and significantly increase the hit rate.

Content Centric Networking (CCN) is a new architecture for a future Internet. CCN is a clean-state architecture that targets the distribution of content. As such, content is located at the heart of the architecture and CCN includes two main features: communication led by names and caches everywhere. Nevertheless, CCN has been criticized due to the economical cost of replacing every IP router with a CCN router. As such, we assume that CCN will be used for small content delivery networks –Micro CDNs– located in the ISP facilities: it has already been shown that with only 100MB of caches in the ISP facilities, the ISP traffic to the Internet can be reduced by 25%. As a matter of fact, if CCN is deployed as a Micro CDN, gateways must exist to interconnect the CDN network with the Internet. In this paper, we study the advantages of using multiple gateways against a single gateway and its impact on the caching features. Our results show that multiple gateways are beneficial not only because they improve the performance of caches but also because the load of the network get distributed across several nodes.

Content Centric Networking (CCN) performance by definition depends on the in-network caching efficiency. We propose CodingCache which utilizes network coding and random forwarding to improve caching efficiency under multipath forwarding. Its advantage is that existing caching strategies can be easily incorporated with it for better performance. We evaluate CodingCache by extensive simulation experiments with the China Telecom network topology and a unique dataset consisting of video access logs from the PPTV system. The results demonstrate that compared with the CCN caching strategy, CodingCache improves the cache hit rate by about 60%.

Since its conception, Internet has not been dedicated to interconnecting geographically distributed areas requiring high throughput, huge storage capacity and continuous architecture analysis to detect network changes and react appropriately. Software Defined Networks and Content Centric Networks are two active areas deployed in most application areas such as mobile networks, IoT and cloud computing. Leveraging the benefits of both is a new research trend exploring the challenges and the benefits of this grouping. In this context, our present work presents a proactive caching strategy named LEarning based Cooperative Caching (LECC) for CCN networks based SDN architecture. This strategy is consolidated by a reassignment module to reassign a router according to network constraints continuously verified. Our solution combines in-network caching and network management automation based on the consistent network view provided by controller synchronization. In this paper, we present a collaborative caching scheme in CCNs monitored by SDN controllers which can fully exploit both on-path and off-path caching by cooperative caching domain and network global view. This strategy can be used to improve efficiency and reduce user load. Simulation Results show that the proposed is effective and outperforms the existing caching mechanisms in CCN.

Content delivery such as P2P or video streaming generates the main part of the Internet traffic and Content Centric Network (CCN) appears as an appropriate architecture to satisfy the user needs. However, the lack of scalable routing scheme is one of the main obstacles that slows down a large deployment of CCN at an Internet-scale. In this paper we propose to use the Software-Defined Networking (SDN) paradigm to decouple data plane and control plane and present SRSC, a new routing scheme for CCN. Our solution is a clean-slate approach using only CCN messages and the SDN paradigm. We implemented our solution into the NS-3 simulator and perform simulations of our proposal. SRSC shows better performances than the flooding scheme used by default in CCN: it reduces the number of messages, while still improves CCN caching performances.

In this work, we study the caching performance of Content Centric Networking (CCN), with special emphasis on the size of individual CCN router caches. Specifically, we consider several graph-related centrality metrics (e.g., betweenness, closeness, stress, graph, eccentricity and degree centralities) to allocate content store space heterogeneously across the CCN network, and contrast the performance to that of an homogeneous allocation.

Content-centric networking (CCN) introduces a paradigm shift from a host centric to an information centric communication model for future Internet architectures. It supports the retrieval of a particular content regardless of the physical location of the content. Content caching and content delivery networks are the most popular approaches to deal with the inherent issues of content delivery on the Internet that are caused by its design. Moreover, intermittently connected mobile environments or disruptive networks present a significant challenge to CCN deployment. In this paper, we consider the possibility of using mobile users in improving the efficiency of content delivery. Mobile users are producing a significant fraction of the total Internet traffic, and modern mobile devices have enough storage to cache the downloaded content that may interest other mobile users for a short period too. We present an analytical model of the CCN framework that integrates a delay tolerant networking architecture into the native CCN, and we present large-scale simulation results. Caching on mobile devices can improve the content retrieval time by more than 50%, while the fraction of the requests that are delivered from other mobile devices can be more than 75% in many cases.

Wireless distributed cache system (WDCS) is a promising technique to offload traffic and improve energy efficiency in content-centric networks. In this paper, the content sharing problem is considered by minimizing the average energy consumption for content caching and delivering in device-to-device (D2D) enabled cellular networks. The problem is formulated as a joint optimization problem of multiple interactive variables, which is NP-hard. In order to solve this problem, we first decompose the original problem into three subproblems, which are content helper (CH) selection, content caching, and content delivering. Specifically, in CH selection, we propose a PageRank based distributed algorithm to estimate the centrality of mobile users (MUs) by jointly analyzing their social relationships and channel conditions. Based on the selected CHs, the content caching and content delivering are formulated into two weighted matching problems. Two belief propagation (BP) based distributed algorithms are then proposed by considering content popularity and channel states to solve the aforementioned problems. Furthermore, based on the correlation of the three subproblems, a heuristic-based alternating iterative optimization method (HAIOM) is proposed to improve the average energy consumption performance of the content delivering of the WDCS. Simulation results show that by jointly optimizing the CH selection, content caching, and content delivering, the proposed scheme is capable of reducing the average energy consumption and the average content delivery delay, as well as of increasing the caching hit ratio.