Information-centric mobile caching network frameworks and caching optimization: a survey <s> Chunk-level content popularity <s> Content-centric networking proposals, as Parc's CCN, have recently emerged to define new network architectures where content, and not its location, becomes the core of the communication model. These new paradigms push data storage and delivery at network layer and are designed to better deal with current Internet usage, mainly centered around content dissemination and retrieval. In this paper, we develop an analytical model of CCN in-network storage and receiver-driven transport, that more generally applies to a class of content ori ented networks identified by chunk-based communication. We derive a closed-form expression for the mean stationary throughput as a function of hit/miss probabilities at the caches along the path, of content popularity and of content/cache size. Our analytical results, supported by chunk level simulations, can be used to analyze fundamental trade-offs in current CCN architecture, and provide an essential building block for the design and evaluation of enhanced CCN protocols. <s> BIB001 </s> Information-centric mobile caching network frameworks and caching optimization: a survey <s> Chunk-level content popularity <s> In content-oriented networking, content files are typically cached in network nodes, and hence how to cache content files is crucial for the efficient content delivery and cache storage utilization. In this paper, we propose a content caching scheme, WAVE, in which the number of chunks to be cached is adjusted based on the popularity of the content. In WAVE, an upstream node recommends the number of chunks to be cached at its downstream node, which is exponentially increased as the request count increases. Simulation results reveal that the average hop count of content delivery of WAVE is lower than other schemes, and the inter-ISP traffic volume of WAVE is the second lowest (CDN is the lowest). Also, WAVE achieves higher cache hit ratio and fewer frequent cache replacements than other on-demand caching strategies. <s> BIB002 </s> Information-centric mobile caching network frameworks and caching optimization: a survey <s> Chunk-level content popularity <s> Information Centric Network (ICN) proposals, have recently emerged to define new network architectures where content, and not its location, becomes the core of the communication model. Such new paradigms push data storage and delivery at network layer and are designed to cope with current Internet usage, mainly centered around content dissemination and retrieval.In this paper, we develop an analytical model of ICN storage and bandwidth sharing under fairly general assumptions on total demand, topology, content popularity and limited network resources. Our study applies to a class of content oriented networks identified by receiver-driven packet-based communication with in-network storage. We derive a closed-form expression for expected stationary delivery time as a function of hit/miss probabilities at network caches, content popularity and cache sizes. Our analytical results, supported by packet level simulations, can be used to analyze fundamental trade-offs of ICN architectures. They also provide an essential building block for the design and evaluation of ICN protocols. <s> BIB003 </s> Information-centric mobile caching network frameworks and caching optimization: a survey <s> Chunk-level content popularity <s> Internet usage has drastically shifted from host-centric end-to-end communication to receiver-driven content retrieval. In order to adapt to this change, a handful of innovative information/content centric networking (ICN) architectures have recently been proposed. One common and important feature of these architectures is to leverage built-in network caches to improve the transmission efficiency of content dissemination. Compared with traditional Web Caching and CDN Caching, ICN Cache takes on several new characteristics: cache is transparent to applications, cache is ubiquitous, and content to be cached is more ine-grained. These distinguished features pose new challenges to ICN caching technologies. This paper presents a comprehensive survey of state-of-art techniques aiming to address these issues, with particular focus on reducing cache redundancy and improving the availability of cached content. As a new research area, this paper also points out several interesting yet challenging research directions in this subject. <s> BIB004 </s> Information-centric mobile caching network frameworks and caching optimization: a survey <s> Chunk-level content popularity <s> Abstract Content-Centric Networking (CCN) is a candidate future Internet architecture that gives favourable promises in distributed wireless environments. The latter ones seriously call into question the capability of TCP/IP to support stable end-to-end communications, due to lack of centralized control, node mobility, dynamic topologies, intermittent connectivity, and harsh signal propagation conditions. The CCN paradigm, relying on name-based forwarding and in-network data caching , has great potential to solve some of the problems encountered by IP-based protocols in wireless networks. In this paper, we examine the applicability of CCN principles to wireless networks with distributed access control, different degrees of node mobility and resource constraints. We provide some guidelines for readers approaching research on CCN, by highlighting points of strength and weaknesses and reviewing the current state of the art. The final discussion aims to identify the main open research challenges and some future trends for CCN deployment on a large scale. <s> BIB005
Receiver-driven chunk-based transport is supported in CDN and NDN, that is to say, content items stored in the repository are splitted into self-identified chunks, and in turn request process is divided into content and chunk level  BIB003 . As popularity is one of the most important features which affect cache efficiency BIB004 , the popularity of contents follows Zipf or Zipf-like distribution, e.g. a content can be divided into small size chunks BIB002  BIB001 , the probability distribution of requests of contents follows Zipf distribution BIB002 , and Markov Modulated Rate Process of requests with Zipfdistributed content popularity  BIB001 , but the popularity of chunk-level contents is not mentioned yet. From the analytical perspective, establishing the chunk-level content popularity model from prior knowledge is of great significance. From the experimental point of view, since there is no large-scale operational ICN network infrastructure and applications at present, it is difficult to measure the chunk-level object popularity directly BIB005 . To the best of our knowledge, whether the popularity law is suitable for chunk-level content still lacks analytical and experimental study.