Enhanced Adaptive Insertion Policy for Shared Caches

Li, Chongmin; Wang, Dongsheng; Xue, Yibo; Wang, Haixia; Zhang, Xi

doi:10.1007/978-3-642-24151-2_2

Cited by 6 publications

(5 citation statements)

References 14 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…The work by C. Li. [10] establishes the policies for cache updation by inclusion. This policy is briefly criticized for limitation in the cache sizes on the MANET nodes.…”

Section: Outcomes From the Parallel Researchesmentioning

confidence: 99%

An Energy Aware Strategy for Distributed Cache Discovery with Stale Page Reduction

Rani*,

Seetha

2019

IJITEE

View full text Add to dashboard Cite

With the immense growth in the field of mobile communication, a good number of complex applications are now available for the mobile devices. The complex applications are made available to comply with the client demand for the higher performing and higher capable applications, which can be accessible from any locations and any devices. Thus, the application developers have attempted to make highly scaled applications to be deployed on mobile communication devices. The larger applications have higher demand for memory and processing capabilities. Thus, making the similar infrastructure available on the mobile computing environments was always a challenge. Nonetheless, with the availability of distributed computing architecture, the bottleneck for the computing capabilities for these complex applications can be handled. Nonetheless, the memory capabilities for the applications must be addressed more sophisticated manner using distribution of the memory and sharing of the data. Henceforth, distributed caching came under existence.A conveyed cache is an augmentation of the customary idea of cache utilized in a solitary district. A conveyed cache may traverse various servers with the goal that it can develop in size and in value-based limit. It is for the most part used to store application information living in database and web session information.One of the most popular technique for making the cache available is to perform cache discovery operations in the network. A number of parallel research attempts are made to identify the accurate place in the network to create or build the distributed cache network.However, the most of the parallel research attempts are criticised for considering single dimensions for cache discovery as few of the work focuses on distance, few of the work focuses on density and some of the works focuses on page replacement policies applicable on mobile computing environments as MANETs or WSN. Henceforth, the demand of the research is to consider multiple parameters for cache discovery and build a framework to automatically define the cache distribution. Hence, this work proposes a novel architecture or framework to detect the cache distribution based on distance, stale page reduction mechanism and finally the energy optimization. The outcome of the research is to automate the recommendation of cache discovery and increase the network life time by 90% compared to the existing methods for cache discovery. In order to handle the complex processing of the proposed algorithms, this work deploys machine learning methods to reduce the time complexity.

show abstract

“…The work by C. Li. [10] establishes the policies for cache updation by inclusion. This policy is briefly criticized for limitation in the cache sizes on the MANET nodes.…”

Section: Outcomes From the Parallel Researchesmentioning

confidence: 99%

An Energy Aware Strategy for Distributed Cache Discovery with Stale Page Reduction

Rani*,

Seetha

2019

IJITEE

View full text Add to dashboard Cite

show abstract

“…The second technique is LFU in which data that were requested from the server a lot in the past will be requested a lot again . In general, one recognized problem with cache replacement is that when a relatively large data item is requested, it may end up replacing many small cached items in the cache …”

Section: State‐of‐the‐art Cache Replacement Algorithmsmentioning

confidence: 99%

“…In the literature, a lot of variables have been used to remove data items from the cache such as data size, last time accessed, distance from the node that accesses the document, time when replica stored in the cache, the mobility of the clients, update frequency, and retrieve delay. Given the difficulties to define the associations between the previous major variables are unidentified or unwell comprehended, finding that the optimal solution is a major part of the cache problem.…”

Section: Introductionmentioning

confidence: 99%

An intelligent database proactive cache replacement policy for mobile communication system based on genetic programming

Darwish

El-Shnawy

2018

Int J Communication

View full text Add to dashboard Cite

In the mobile environment, the movement of the users, disconnected modes, many data updates, power battery consumption, limited cache size, and limited bandwidth impose significant challenges in information access. Caching is considered one of the most important concepts to deal with these challenges.There are 2 general topics related to the client cache policy: cache invalidation method keeps data in the cache up to date and cache replacement method chooses the cached element(s) that would be removed from the cache once the cache stays full. The aim of this work is to introduce a new technique for cache replacement in a mobile database that takes into consideration the impact of invalidation time for enhancing data availability in the mobile environment by using genetic programming. In this case, each client collects information for every cached item in the cache like access probability, cached document size, and validation time and uses these factors in a fitness function to determine cached items that will be removed from the cache. The experiments were carried by NS2 simulator to assess the efficiency of the proposed method, and the outcomes are judged against existing cache replacement algorithms. It is concluded that the proposed approach performs significantly better than other approaches. KEYWORDScache invalidation, cache replacement, genetic programming, mobile database | INTRODUCTIONWith the rapid changes in technology, mobile communications are the essential part of our daily life. People are using the wireless network for making phone calls, accessing the Internet to download news, the stock market, etc. Different techniques for enhancing the capability and quality of wireless environments have become a hot research area. The development of mobile information systems has met some disadvantages. Mobile machines regularly have slight storage dimension and inadequate energy. Furthermore, mobile client users in wireless environments suffer from frequent disconnections from the server, and also calling the server for information is costly. For that reason, scholars have discovered caching approaches for valuable data managing in the mobile podium. 1-3 Still, a key difficulty is how to preserve the collected items in the cache up to date with the source data at the server.

show abstract

“…The second technique is called least frequently used, the least requested data items are the first out of cache [16]. In general, one recognised problem with cache replacement is that when a relatively large data item is requested, it may end up replacing many small cached items in the cache [10–13, 17, 18].…”

Section: State‐of‐the‐art Cache Replacement Algorithmmentioning

confidence: 99%

“…A lot of variables [1, 10–13] have been used to remove data items from the cache when the cache is full such as data size, last time accessed, access account, distance from the node that access the document, time when replica stored in cache, mobility of the clients, update frequency, retrieve delay etc. Therefore, the selection of these parameters to be used in the cache replacement algorithm, and what data elements will be excluded from the cache when the cache is full are great challenges.…”

Section: Introductionmentioning

confidence: 99%

Proactive cache replacement technique for mobile networks based on genetic programming

2018

View full text Add to dashboard Cite

In the mobile environment, the movement of users, disconnected modes, many data updates, power battery consumption, limited cache size, and limited bandwidth impose significant challenges to information access. Caching is considered one of the most important concepts to deal with these challenges. There are two general topics related to the client cache policy: cache invalidation method keeps data in the cache up to date; and cache replacement method chooses the cached item(s) which should be deleted from the cache when the cache is full. The aim of this work is to propose a new technique for cache replacement in a mobile database that takes into consideration the impact of invalidation time for enhancing data availability in the mobile environment by using genetic programming. In this case, each client collects information for every cached item in the cache like access probability, cached document size, validation time and uses these factors in a fitness function to determine cached items that will be removed from the cache. The experiments were performed using Network Simulator 2 to evaluate the effectiveness of the proposed approach, and the results are compared with the existing cache replacement algorithms. It is concluded that the proposed approach performs significantly better than other approaches.

show abstract

Enhanced Adaptive Insertion Policy for Shared Caches

Cited by 6 publications

References 14 publications

An Energy Aware Strategy for Distributed Cache Discovery with Stale Page Reduction

An Energy Aware Strategy for Distributed Cache Discovery with Stale Page Reduction

An intelligent database proactive cache replacement policy for mobile communication system based on genetic programming

Proactive cache replacement technique for mobile networks based on genetic programming

Contact Info

Product

Resources

About