A key based cache replacement policy for cooperative caching in mobile ad hoc networks

Cooperative caching in mobile ad hoc networks aims at improving the efficiency of information access by reducing access latency and bandwidth usage. Cache replacement policy plays a vital role in improving the performance of a cache in a mobile node since it has limited memory. In this paper we propose a new key based cache replacement policy called E-LRU for cooperative caching in ad hoc networks. The proposed scheme for replacement considers the time interval between the recent references, size and consistency as key factors for replacement. Simulation study shows that the proposed replacement policy can significantly improve the cache performance in terms of cache hit ratio and query delay

A Novel Cache Resolution Technique For Cooperative Caching In Wireless Mobile Networks

Cooperative caching is used in mobile ad hoc networks to reduce the latency perceived by the mobile clients while retrieving data and to reduce the traffic load in the network. Caching also increases the availability of data due to server disconnections. The implementation of a cooperative caching technique essentially involves four major design considerations (i) cache placement and resolution, which decides where to place and how to locate the cached data (ii) Cache admission control which decides the data to be cached (iii) Cache replacement which makes the replacement decision when the cache is full and (iv) consistency maintenance, i.e. maintaining consistency between the data in server and cache. In this paper we propose an effective cache resolution technique, which reduces the number of messages flooded in to the network to find the requested data. The experimental results gives a promising result based on the metrics of studies.

A virtual backbone based approach for cooperative caching in mobile ad hoc networks

Cache look up is an integral part of cooperative caching in ad hoc networks. In this paper, we discuss a cooperative caching architecture with a distributed cache look up protocol which relies on a virtual backbone for locating and accessing data within a cooperate cache. Our proposal consists of two phases: (i) formation of a virtual backbone and (ii) the cache look up phase. The nodes in a Connected Dominating Set (CDS) form the virtual backbone. The cache look up protocol makes use of the nodes in the virtual backbone for effective data dissemination and discovery. The idea in this scheme is to reduce the number of nodes involved in cache look up process, by constructing a CDS that contains a small number of nodes, still having full coverage of the network. We evaluated the effect of various parameter settings on the performance metrics such as message overhead, cache hit ratio and average query delay. Compared to the previous schemes the proposed scheme not only reduces message overhead, but also improves the cache hit ratio and reduces the average delay

Cooperative Caching Framework for Mobile Cloud Computing

Due to the advancement in mobile devices and wireless networks mobile cloud computing, which combines mobile computing and cloud computing has gained momentum since 2009. The characteristics of mobile devices and wireless network makes the implementation of mobile cloud computing more complicated than for fixed clouds. This section lists some of the major issues in Mobile Cloud Computing. One of the key issues in mobile cloud computing is the end to end delay in servicing a request. Data caching is one of the techniques widely used in wired and wireless networks to improve data access efficiency. In this paper we explore the possibility of a cooperative caching approach to enhance data access efficiency in mobile cloud computing. The proposed approach is based on cloudlets, one of the architecture designed for mobile cloud computing.

A location aided cooperative caching protocol for mobile ad hoc networks

Cooperative caching is an attractive solution for reducing bandwidth demands and network latency in mobile ad hoc networks. Deploying caches in mobile nodes can reduce the overall traffic considerably. Cache hits eliminate the need to contact the data source frequently, which avoids additional network overhead. In this paper we propose a data discovery and cache management policy for cooperative caching, which reduces the caching overhead and delay by reducing the number of control messages flooded in to the network. A cache discovery process based on location of neighboring nodes is developed for this. The cache replacement policy we propose aims at increasing the cache hit ratio. The simulation results gives a promising result based on the metrics of studies

Reducing cache lookup and publish overhead through locality awareness in P2P web caching

Peer-to-Peer (P2P) Web caching has been a hot research topic in recent years as it can create scalable and robust designs for decentralized Internet-scale applications. However, many P2P Web caching systems suffer expensive overheads such as lookup and publish messages, and lack of locality awareness. In this paper we present the development of a locality aware P2P cache system to overcome these limitations by using routing table locality, aggregation and soft state. The experiments show that our P2P cache system improves the performance of index operations through the reduction of the amount of information processed by nodes, the reduction of the number of index messages sent by nodes, and the improvement of the locality of cache pointers.

A cooperative cache architecture in support of caching multimedia objects in MANETs

This paper presents a cooperative caching architecture suitable for continuous media (CM) proxy caching in MANET environments. The proposed scheme introduces an application manager component, which is interposed between traditional Internet CM applications and the network layer. The application manager transparently performs data location and service migration of active CM streaming sessions so as to exploit nearby data sources based on the dynamic topology of a MANET. We propose two data location schemes - Cache-State - a link-state based scheme and Reactive - an on-demand scheme. Since service migration can occur frequently, the application manager uses soft-state signaling techniques to communicate between remote application managers by translating hard-state application signaling, such as Real Time Streaming Protocol (RTSP) into soft-state messages. The proposed schemes are evaluated through simulation studies using the NS simulator. Simulation studies show that both Cache-State and Reactive schemes demonstrate significant QoS improvements and reduced bandwidth consumption.

A generalised cost-aware caching scheme for caching continuous media objects in best-effort network environments

In this paper, we investigate the potential of caching to improve QoS in the context of continuous media applications over wired best-effort networks. We propose the use of a flexible caching scheme, called GD-Multi in caching continuous media (CM) objects. An important novel feature of our scheme is the provision of user or system administrator inputs in determining the cost function. Based on the proposed flexible cost function, Multi, an improvised Greedy Dual (GD) replacement algorithm called GD-multi (GDM) has been developed for layered multi-resolution multimedia streams. The proposed Multi function takes receiver feedback into account. We investigate the influence of parameters such as loss rate, jitter, delay and area in determining a proxy’s cache contents so as to enhance QoS perceived by clients. Simulation studies show improvement in QoS perceived at the clients in accordance to supplied optimisation metrics. From an implementation perspective, signalling requirements for carrying QoS feedback are minimal and fully compatible with existing RTSP-based Internet applications.

Hoarding of pulsed resources : temporal variations in egg-caching by arctic fox

Resource pulses are common in various ecosystems and often have large impacts on ecosystem functioning. Many animals hoard food during resource pulses, yet how this behaviour affects pulse diffusion through trophic levels is poorly known because of a lack of individual-based studies. Our objective was to examine how the hoarding behaviour of arctic foxes (Alopex lagopus) preying on a seasonal pulsed resource (goose eggs) was affected by annual and seasonal changes in resource availability. We monitored foraging behaviour of foxes in a greater snow goose (Chen caerulescens atlanticus) colony during 8 nesting seasons that covered 2 lemming cycles. The number of goose eggs taken and cached per hour by foxes declined 6-fold from laying to hatching, while the proportion of eggs cached remained constant. In contrast, the proportion of eggs cached by foxes fluctuated in response to the annual lemming cycle independently of the seasonal pulse of goose eggs. Foxes cached the majority of eggs taken (> 90%) when lemming abundance was high or moderate but only 40% during the low phase of the cycle. This likely occurred because foxes consumed a greater proportion of goose eggs to fulfill their energy requirement at low lemming abundance. Our study clearly illustrates a behavioural mechanism that extends the energetic benefits of a resource pulse. The hoarding behaviour of the main predator enhances the allochthonous nutrients input brought by migrating birds from the south into the arctic terrestrial ecosystem. This could increase average predator density and promote indirect interactions among prey.

Surviving on cached foods - the energetics of egg-caching by arctic foxes

Food-caching by arctic foxes (Vulpes lagopus (L., 1758)) is a behavioural adaptation thought to increase winter survival, especially in bird colonies where a large number of eggs can be cached during a short nesting season. In this paper, we measured the energy content of greater snow goose (Chen caerulescens atlantica Kennard, 1927) eggs and evaluated their perishability when cached in tundra soil for a whole summer. We estimated that eggs lost only ~8% of their dry mass over 60 days of storage in the ground. We used published estimates on digestibility of nutrients by arctic foxes to estimate that fresh and stored goose eggs contained 816 and 730 kJ of metabolizable energy, respectively, a difference of 11%. Using information on arctic fox energetics, we evaluated that 145 stored eggs were required to sustain the growth of one pup from the age of 1 to 3 months (nutritional independence). Moreover, 23 stored eggs were energetically equivalent to the average fat deposit of an arctic fox during winter. Finally, we calculated that an adult arctic fox would need to recover 160-220 stored eggs to survive 6 months in resting conditions during cold winter temperatures. This value increased to 480 when considering activity cost. Based on egg acquisition and caching rates observed in many goose colonies, we conclude that cached eggs represent an important source of energy relative to the needs of an arctic fox during winter, and have thus a high fitness value.

The role of seed mass on the caching decision by agoutis, Dasyprocta leporina (Rodentia: Agoutidae)

Fundação de Amparo à Pesquisa do Estado de São Paulo (FAPESP)

Caching and Visualizing Statistical Analyses

We present the cacher and CodeDepends packages for R, which provide tools for (1) caching and analyzing the code for statistical analyses and (2) distributing these analyses to others in an efficient manner over the web. The cacher package takes objects created by evaluating R expressions and stores them in key-value databases. These databases of cached objects can subsequently be assembled into “cache packages” for distribution over the web. The cacher package also provides tools to help readers examine the data and code in a statistical analysis and reproduce, modify, or improve upon the results. In addition, readers can easily conduct alternate analyses of the data. The CodeDepends package provides complementary tools for analyzing and visualizing the code for a statistical analysis and this functionality has been integrated into the cacher package. In this chapter we describe the cacher and CodeDepends packages and provide examples of how they can be used for reproducible research.

Persistent Caching in Information-Centric Networks

Information-centric networking (ICN) is a new communication paradigm that aims at increasing security and efficiency of content delivery in communication networks. In recent years, many research efforts in ICN have focused on caching strategies to reduce traffic and increase overall performance by decreasing download times. Since caches need to operate at line speed, they have only a limited size and content can only be stored for a short time. However, if content needs to be available for a longer time, e.g., for delay-tolerant networking or to provide high content availability similar to content delivery networks (CDNs), persistent caching is required. We base our work on the Content-Centric Networking (CCN) architecture and investigate persistent caching by extending the current repository implementation in CCNx. We show by extensive evaluations in a YouTube and webserver traffic scenario that repositories can be efficiently used to increase content availability by significantly increasing cache hit rates.