Autonomic Cache Management in Information-Centric Networks (original) (raw)

Survey on Caching Approaches in Information Centric Networking

Journal of Network and Computer Applications, 2015

Information Centric Network (ICN) is increasingly becoming the alternative paradigm to the traditional Internet through improving information (content) dissemination on the Internet with names. The need to reduce redundancy and frequent access to a host (provider of information) has raised an alternative of a man-in-middle concept of ICN. This has necessitated the introduction of some ICN popular architectures (such as Named Data Network (NDN), Content Centric Network (CCN), to name a few) to manage the salient advantages incorporated in ICN. Despite all efforts and issues in naming, security, routing and mobility, power consumption; caching has become the leading variable to fully actualize the future Internet dream by carefully solving the problems in frequency and recency (in objects). Determining what part of the content is to be cached? When is the most appropriate time for caching? How would the object be cached (placed and replaced) and also what path would the object be cached? Thus, this paper span through some selected ICN architectures and projects to investigate and suggest forms of caching in minimizing the total bandwidth consumption, enhanced Delivery of Service (DoS), reduced upwards and downward streaming. In conclusion, pointing out some of the future probable ways to improve caching in ICN. This survey also highlighted the top sensitive issues that influence the active deployment of caches in ICN through recency, frequency, content size, cost of retrieval and coordination, update in caches and replacements. Several cache characteristics were further presented in ways that would improve cache techniques, deployments as research suggestions for content placement, replacement and quick scan on nodes on and off-path of the network.

Caching and Data Routing In Information Centric Networking (ICN): The Future Internet Perspective

Information Centric Networking (ICN) is becoming an important direction of the future internet architecture research. Different ICN architectures like PSIRP, NetInf, PURSUIT, CCN, DONA, and NDN have been proposed with the aim of moving from the current host-to-host communication model to a content-centric communication model. Caching and data routing are among the most significant properties of ICN features which improves network efficiency and content distribution performance by satisfying user requests with cached content. New characteristics of ICN caching include the Internet to be transparent to applications, ubiquitous in-network caching (caching contents in routers in a granularity based-level different from the current Internet architecture which cache contents in file-level. This paper describes in-depth, the concepts of caching and data routing in ICN by providing a comprehensive survey of a number of cache decision and data routing policies in ICN. The paper provides also the caching and data routing mechanisms in the Named Data Networking (NDN) which is the promising ICN design for the future Internet architecture. In general, by modelling the in-network caching and data routing which will be based on more efficient cache decision and routing schemes, it will have more practical significance in ICN designs for the future Internet architecture.

Cache-skip approach for information-centric network

2016

Several ICN cache deployment and management techniques have since been using the Web management techniques to manage information sharing and better cache-hit ratio.Leave Copy Down, Leave Copy Everywhere and Probabilistic cache managements have gained more attention. However, with Leave Copy Everywhere being the initial design specification in ICN proposal, several research issues of content manageability have posed a threat of particularly content and path redundancy.This paper presents an extensive simulation analysis of the popular cache management techniques by subjecting the concepts into different network topologies to investigate the prospect of extending and proposing a new form of cache management in ICN known as Cache-skip. Cache-skip use the consciousness of time of request, network size and Time Since Birth (TSB) and Time Since Inception (TSI) to carefully dedicate the positions of caching to benefits hit rates and less network stress as a form to efficiently utilize the ...

Efficient cache availability management in Information-Centric Networks

Computer Networks, 2015

In-network caching is one of the fundamental operations of Information-centric networks (ICN). The default caching strategy taken by most of the current ICN proposals is caching along-default-path, which makes popular objects to be cached redundantly across the network, resulting in a low utilization of available cache space. On the other hand, efficient use of network-wide cache space requires possible cooperation among caching routers without the use of excessive signaling burden. While most of the cache optimization efforts strive to improve the latency and the overall traffic efficiency, we have taken a different path in this work and improved the storage efficiency of the cache space so that it is utilized to its most. In this work we discuss the ICN caching problem, and propose a novel distributed architecture to efficiently use the network-wide cache storage space based on distributed caching. The proposal achieves cache retention efficiency by means of controlled traffic redirection and selective caching. We utilize the ICN mechanisms and routing protocol messages for decision making, thus reducing the overall signaling need. Our proposal achieves almost 9-fold increase in cache storage efficiency, and around 20% increase in server load reduction when compared to the classic caching methods used in contemporary ICN proposals.

On the cache performance of the information centric network

2013 INTERNATIONAL CONFERENCE ON COMPUTING, ELECTRICAL AND ELECTRONIC ENGINEERING (ICCEEE), 2013

The current Internet model has proved more sustainable then the provisioned capacity at the time when the architecture was designed. The voluminous growth of traffic over the Internet has brought challenges for the exiting networking architecture. The information centric paradigm appears to offer efficient solution towards content dissemination model. It is a content-focused networking paradigm rather than host-to-host communication. Caching is one of the major components of information centric networks. This paper is intended to explore the impact of cache on critical attributes of networks. We have made a comparative analysis of in-network and edge network caching mechanism using network simulation. The results proved that in-network caching mechanism is far better than network edge caching with improved throughout, increase link capacity to avoid congestion.

NECS-based Cache Management in the Information Centric Networking

International Journal of Interactive Mobile Technologies (iJIM)

The Information Centric Networking ICN architectures are proposed to overcome the problems of the actual internet architecture. One of the main straight points of the ICN architectures is the in-network caching. The ICN performance is influenced by efficiency of the adopted caching strategy which manages the contents in the network and decides where caching them. However, the major issue which faces the caching strategies in the ICN architectures is the strategic election of the cache routers to store the data through its delivery path. This will reduce congestion, optimize the distance between the consumers and the required data furthermore improve latency and alleviate the viral load on the servers. In this paper, we propose a new efficient caching strategy for the Named Data Networking architecture NDN named NECS which is the most promising architecture between all the ICN architectures. The proposed strategy reduces the traffic redundancy, eliminates the useless replication of ...

Cooperative caching through routing control in information-centric networks

2013 Proceedings IEEE INFOCOM, 2013

Information-centric network (ICN), which is one of the prominent Internet re-design architectures, relies on in-network caching for its fundamental operation. However, previous works argue that the performance of in-network caching is highly degraded with the current cache-along-default-path design, which makes popular objects to be cached redundantly in many places. Thus, it would be beneficial to have a distributed and uncoordinated design. Although cooperative caches could be an answer to this, previous research showed that they are generally unfeasible due to excessive signaling burden, protocol complexity, and a need for fault tolerance.

In-Network Cache Management and Resource Allocation for Information-Centric Networks

IEEE Transactions on Parallel and Distributed Systems, 2014

We introduce the concept of resource management for in-network caching environments. We argue that in Information-Centric Networking environments, deterministically caching content messages at predefined places along the content delivery path results in unfair and inefficient content multiplexing between different content flows, as well as in significant caching redundancy. Instead, allocating resources along the path according to content flow characteristics results in better use of network resources and therefore, higher overall performance. The design principles of our proposed in-network caching scheme, which we call ProbCache, target these two outcomes, namely reduction of caching redundancy and fair content flow multiplexing along the delivery path. In particular, ProbCache approximates the caching capability of a path and caches contents probabilistically to: 1) leave caching space for other flows sharing (part of) the same path, and 2) fairly multiplex contents in caches along the path from the server to the client. We elaborate on the content multiplexing fairness of ProbCache and find that it sometimes behaves in favor of content flows connected far away from the source, that is, it gives higher priority to flows travelling longer paths, leaving little space to shorter-path flows. We introduce an enhanced version of the main algorithm that guarantees fair behavior to all participating content flows. We evaluate the proposed schemes in both homogeneous and heterogeneous cache size environments and formulate a framework for resource allocation in in-network caching environments. The proposed probabilistic approach to in-network caching exhibits ideal performance both in terms of network resource utilization and in terms of resource allocation fairness among competing content flows. Finally, and in contrast to the expected behavior, we find that the efficient design of ProbCache results in fast convergence to caching of popular content items.

A survey of information-centric networking

IEEE Communications Magazine, 2012

The information-centric networking (ICN) concept is a significant common approach of several future Internet research activities. The approach leverages in-network caching, multiparty communication through replication, and interaction models decoupling senders and receivers. The goal is to provide a network infrastructure service that is better suited to today¿s use (in particular. content distribution and mobility) and more resilient to disruptions and

PopCache: Cache More or Less Based on Content Popularity for Information-Centric Networking

Due to a mismatch between downloading and caching content, the network may not gain significant benefit from the sophisticated in-network caching of information-centric networking (ICN) architectures by using a basic caching mechanism. This paper aims to seek an effective caching decision policy to improve the content dissemination in ICN. We propose PopCache-a caching decision policy with respect to the content popularity-that allows an individual ICN router to cache content more or less in accordance with the popularity characteristic of the content. We propose an analytical model to evaluate the performance of different caching decision policies in terms of the server-hit rate and expected round-trip time. The analysis confirmed by simulation results shows that PopCache yields the lowest expected round-trip time compared with three benchmark caching decision policies, i.e., the always, fixed probability and path-capacity-based probability, and PopCache provides the server-hit rate comparable to the lowest ones.