scholarly journals A future location-aware replacement policy for the cache management at the mobile terminal

2009 ◽  
Vol 9 (5) ◽  
pp. 607-629 ◽  
Author(s):  
Stylianos Drakatos ◽  
Niki Pissinou ◽  
Kia Makki ◽  
Christos Douligeris
2003 ◽  
pp. 203-244 ◽  
Author(s):  
Dimitrios Katsaros ◽  
Yannis Manolopoulos

The Web has become the primary means for information dissemination. It is ideal for publishing data residing in a variety of repositories, such as databases. In such a multi-tier system (client - Web server - underlying database), where the Web page content is dynamically derived from the database (Web-powered database), cache management is very important in making efficient distribution of the published information. Issues related to cache management are the cache admission/replacement policy, the cache coherency and the prefetching, which acts complementary to caching. The present chapter discusses the issues, which make the Web cache management radically different than the cache management in databases or operating systems. We present a taxonomy and the main algorithms proposed for cache replacement and coherence maintenance. We present three families of predictive prefetching algorithms for the Web and characterize them as Markov predictors. Finally, we give examples of how some popular commercial products deal with the issues regarding the cache management for Web-powered databases.


2021 ◽  
Vol 9 (4) ◽  
pp. 0-0

In the location aware services, past mobile device cache invalidation-replacement practises used are ineffective if the client travel route varies rapidly. In addition, in terms of storage expense, previous cache invalidation-replacement policies indicate high storage overhead. These limitations of past policies are inspiration for this research work. The paper describes the models to solve the aforementioned challenges using two different approaches separately for predicting the future path for the user movement. In the first approach, the most prevalent Sequential Pattern Mining & Clustering (SPMC) technique is used to pre-process the user's movement trajectory and find out the pattern that appears frequently. In the second approach, frequent patterns are forwarded into the Mobility Markov Chain & Matrix-(MMCM) algorithm leading to a reduction in the size of candidate sets and, therefore, efficiency enhancement of mining sequence patterns. Analytical results show significant caching performance improvement compared to previous caching policies.


2007 ◽  
Vol 3 (1) ◽  
pp. 19-37 ◽  
Author(s):  
Narottam Chand ◽  
R. C. Joshi ◽  
Manoj Misra

Cooperative caching, which allows sharing and coordination of cached data among clients, is a potential technique to improve the data access performance and availability in mobile ad hoc networks. However, variable data sizes, frequent data updates, limited client resources, insufficient wireless bandwidth and client's mobility make cache management a challenge. In this paper, we propose a utility based cache replacement policy, least utility value (LUV), to improve the data availability and reduce the local cache miss ratio. LUV considers several factors that affect cache performance, namely access probability, distance between the requester and data source/cache, coherency and data size. A cooperative cache management strategy, Zone Cooperative (ZC), is developed that employs LUV as replacement policy. In ZC one-hop neighbors of a client form a cooperation zone since the cost for communication with them is low both in terms of energy consumption and message exchange. Simulation experiments have been conducted to evaluate the performance of LUV based ZC caching strategy. The simulation results show that, LUV replacement policy substantially outperforms the LRU policy.


Sign in / Sign up

Export Citation Format

Share Document