Mobile Cache Management

2011 ◽  
pp. 32-59
Author(s):  
Jianliang Xu ◽  
Haibo Hu ◽  
Xueyan Tang ◽  
Baihua Zheng
Keyword(s):  
Data Access ◽  
Replacement Policy ◽  
Cache Replacement ◽  
Wireless Data ◽  
Mobile Data ◽  
Cache Consistency ◽  
Mobile Caching ◽  
The Cost ◽  
Client Side ◽  
Cache Replacement Policies

This chapter introduces advanced client-side data-caching techniques to enhance the performance of mobile data access. The authors address three mobile caching issues. The first is the necessity of a cache replacement policy for realistic wireless data-broadcasting services. The authors present the Min-SAUD policy, which takes into account the cost of ensuring cache consistency before each cached item is used. Next, the authors discuss the caching issues for an emerging mobile data application, that is, location-dependent information services (LDISs). In particular, they consider data inconsistency caused by client movements and describe several location-dependent cache invalidation schemes. Then, as the spatial property of LDISs also brings new challenges for cache replacement policies, the authors present two novel cache replacement policies, called PA and PAID, for location-dependent data.

Enabling Service Cache in Edge Clouds

2021 ◽  
Vol 2 (3) ◽  
pp. 1-24
Author(s):  
Chih-Kai Huang ◽  
Shan-Hsiang Shen
Keyword(s):  
Virtual Machines ◽  
Replacement Policy ◽  
Cache Replacement ◽  
Cache Replacement Policy ◽  
Average Latency ◽  
Hit Rates ◽  
Iot Devices ◽  
Multi Access ◽  
Computational Resources ◽  
The Cost

The next-generation 5G cellular networks are designed to support the internet of things (IoT) networks; network components and services are virtualized and run either in virtual machines (VMs) or containers. Moreover, edge clouds (which are closer to end users) are leveraged to reduce end-to-end latency especially for some IoT applications, which require short response time. However, the computational resources are limited in edge clouds. To minimize overall service latency, it is crucial to determine carefully which services should be provided in edge clouds and serve more mobile or IoT devices locally. In this article, we propose a novel service cache framework called S-Cache , which automatically caches popular services in edge clouds. In addition, we design a new cache replacement policy to maximize the cache hit rates. Our evaluations use real log files from Google to form two datasets to evaluate the performance. The proposed cache replacement policy is compared with other policies such as greedy-dual-size-frequency (GDSF) and least-frequently-used (LFU). The experimental results show that the cache hit rates are improved by 39% on average, and the average latency of our cache replacement policy decreases 41% and 38% on average in these two datasets. This indicates that our approach is superior to other existing cache policies and is more suitable in multi-access edge computing environments. In the implementation, S-Cache relies on OpenStack to clone services to edge clouds and direct the network traffic. We also evaluate the cost of cloning the service to an edge cloud. The cloning cost of various real applications is studied by experiments under the presented framework and different environments.

A Spatio-Temporal Cache Replacement Policy for Location Dependent Data in Mobile Environments

2010 ◽  
Vol 6 (3) ◽  
pp. 31-48 ◽  
Author(s):  
Mary Magdalene Jane.F ◽  
R. Nadarajan ◽  
Maytham Safar
Keyword(s):  
Data Access ◽  
Data Availability ◽  
Replacement Policy ◽  
Dependent Data ◽  
Access Time ◽  
Cache Replacement ◽  
Cache Replacement Policy ◽  
Active Sets ◽  
Mobile Clients ◽  
Spatio Temporal

Data caching in mobile clients is an important technique to enhance data availability and improve data access time. Due to cache size limitations, cache replacement policies are used to find a suitable subset of items for eviction from the cache. In this paper, the authors study the issues of cache replacement for location-dependent data under a geometric location model and propose a new cache replacement policy RAAR (Re-entry probability, Area of valid scope, Age, Rate of Access) by taking into account the spatial and temporal parameters. Mobile queries experience a popularity drift where the item loses its popularity after the user exhausts the corresponding service, thus calling for a scenario in which once popular documents quickly become cold (small active sets). The experimental evaluations using synthetic datasets for regular and small active sets show that this replacement policy is effective in improving the system performance in terms of the cache hit ratio of mobile clients.

scholarly journals An efficient Intelligent Cache Replacement Policy Suitable for PACS

2021 ◽  
Vol 11 (3) ◽  
pp. 250-255
Author(s):  
Yinyin Wang ◽  
◽  
Yuwang Yang ◽  
Qingguang Wang
Keyword(s):  
Communication Systems ◽  
Replacement Policy ◽  
Support Vector ◽  
Cache Replacement ◽  
Cache Performance ◽  
File Access ◽  
Cache Replacement Policy ◽  
Picture Archiving And Communication ◽  
Intelligent Cache ◽  
Cache Replacement Policies

An efficient intelligent cache replacement policy suitable for picture archiving and communication systems (PACS) was proposed in this work. By combining the Support vector machine (SVM) with the classic least recently used (LRU) cache replacement policy, we have created a new intelligent cache replacement policy called SVM-LRU. The SVM-LRU policy is unlike conventional cache replacement policies, which are solely dependent on the intrinsic properties of the cached items. Our PACS-oriented SVM-LRU algorithm identifies the variables that affect file access probabilities by mining medical data. The SVM algorithm is then used to model the future access probabilities of the cached items, thus improving cache performance. Finally, a simulation experiment was performed using the trace-driven simulation method. It was shown that the SVM-LRU cache algorithm significantly improves PACS cache performance when compared to conventional cache replacement policies like LRU, LFU, SIZE and GDS.

AUGMENTED FIFO CACHE REPLACEMENT POLICIES FOR LOW-POWER EMBEDDED PROCESSORS

2009 ◽  
Vol 18 (06) ◽  
pp. 1081-1092 ◽  
Author(s):  
SANGYEUN CHO ◽  
LORY AL MOAKAR
Keyword(s):  
Low Power ◽  
Energy Savings ◽  
Data Access ◽  
Replacement Policy ◽  
Embedded Processors ◽  
Cache Replacement ◽  
Implementation Cost ◽  
Control Logic ◽  
And Control ◽  
Cache Configuration

This paper explores a family of augmented FIFO replacement policies for highly setassociative caches that are common in low-power embedded processors. In such processors, the implementation cost and complexity of the replacement policy is as important as the cache hit rate. By exploiting the cache hit way information between two replacements, the proposed replacement schemes reduce cache misses by 1% to 18% on average depending on the cache configuration, compared with the conventional FIFO policy. The proposed schemes come at a small implementation cost of additional state bits and control logic. The reduction in cache misses directly translates into data access energy savings of 1% to 15% on average, depending on the cache configuration. Our work suggests that there is room for improving the popular FIFO policy at a small cost.

scholarly journals A Client-Side Cloud Cache Replacement Policy

1970 ◽  
Vol 8 (2) ◽  
pp. 152-160
Author(s):  
Thepparit Banditwattanawong ◽  
Putchong Uthayopas
Keyword(s):  
Performance Metrics ◽  
Replacement Policy ◽  
Cache Replacement ◽  
Cloud Data ◽  
Network Bandwidth ◽  
Computing Services ◽  
Cache Replacement Policy ◽  
Policy Simulations ◽  
Almost All ◽  
Client Side

To deliver data-centric cloud computing services heavily relies on data networks between cloud providers and consumer premises. The continuous and rapid growth of data hosted in external private clouds accelerates downstream network-bandwidth saturation and public cloud data-out overspends. The consumer-initiated replication of cloud data to consumer locality is a solution and known as clientside cloud caching. This paper presents the core mechanism of the cloud caching, called Cloud cache replacement policy. Simulations shown that 1) Cloud saved network bandwidth, data-out charge and data loading time; 2) even Clouds performance minima outperformed three well-known web cache replacement policies across all performance metrics for almost all test cases; 3) Cloud importantly attain optimal hit and byte-hit ratios without sacrificing one to the other.

Cooperative Cache Replacement Policy for MANETs

2014 ◽  
Vol 6 (2) ◽  
pp. 36-47 ◽  
Author(s):  
Prashant Kumar ◽  
Naveen Chauhan ◽  
LK Awasthi ◽  
Narottam Chand
Keyword(s):  
Ad Hoc ◽  
Data Access ◽  
Data Availability ◽  
Replacement Policy ◽  
Cache Replacement ◽  
Cache Replacement Policy ◽  
Cooperative Cache ◽  
Dynamic Topology ◽  
Adhoc Networks ◽  
Hoc Networks

Mobile Adhoc Networks (MANETs) are autonomously structured multi-hop wireless links in peer to peer fashion without aid of any infrastructure network. In MANETs network topology is dynamic, as nodes are mobile. Due to this dynamic topology and multi-hop environment data availability in MANETs is low. Caching of frequently accessed data in ad hoc networks is a potential technique that can improve the data access, performance and availability. While caching the new data items, it is very important which data item is to be removed, as in MANETs the data is not stored only on behalf of caching node but interest of the vicinity is also considered. In this paper the authors presented a new cache replacement policy for MANETs. This policy is based on multi-parameter value called SAT. We simulate the proposed work on OMNET++ and the simulation results shows that proposed replacement policy helps to improve the data availability in network.

Sign in / Sign up

Export Citation Format

Share Document