A Distributed Cache Management Architecture for Mobile Computing Environments

Anandharaj, G.; Anitha, R.

doi:10.1109/iadcc.2009.4809087

Cited by 13 publications

(11 citation statements)

References 11 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…This work is partially criticised for not making the architecture location aware, which might have improved the consistency. Through, the fundamental challenged faced by the research proposal of Anandharaj et al [5] was successfully addressed in that work. The similar recommendation ware also made by P. T. Joy et al [6] and conveyed the standard bottlenecks of this research.…”

Section: Outcomes From the Parallel Researchesmentioning

confidence: 98%

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

Section: Outcomes From the Parallel Researchesmentioning

confidence: 98%

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

“…Value) algorithm [9][10] based on cache replacement policy, where data with the lowest LRV are removed from the cache. Each data item D i has a utility value F i [9].…”

Section: G Anandharaj and Et Al Proposed Lrv (Least Relevantmentioning

confidence: 99%

“…Each data item D i has a utility value F i [9]. An item with the lowest F i value will be chosen to remove when cache space is full.…”

Section: G Anandharaj and Et Al Proposed Lrv (Least Relevantmentioning

confidence: 99%

An Efficient Cache Replacement Strategy in Mobile Cooperative Caching

Minh

Bich

2011

2011 7th International Conference on Wireless Communications, Networking and Mobile Computing

View full text Add to dashboard Cite

Cooperative caching strategies have been proposed to improve access latency, reduce battery power consumption and bandwidth usage in mobile environment. However the biggest disadvantage of these mechanisms is how to manage mobile client's cache effectively due to its limited storage space. In this paper we will present an efficient cache replacement strategy in mobile cooperative caching when mobile client's cache has not enough space to store new data items. We evaluate and demonstrate experimental results on datasets by using NS2 simulator. We also prove the effectiveness by comparing it with other existing approaches. The experimental results present our proposed strategy is more effective than other approaches.

show abstract

“…The main topics in cache management are as follows: (1) Cache replacement policy removes cached items when the cache is full, (2) cache consistency(coherence) policy tries to store the data item in the cache up to date, (3) cache admission policy chooses what data items should be cached, and (4) cache discovery policy collaborates between client nodes for caching and selecting data items from nearest clients nodes. Wireless environment researchers have developed new techniques that take into consideration the obstacles of wireless technology when dealing with the mobile database such as lack of energy, repeated disconnecting from the server.…”

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

A Distributed Cache Management Architecture for Mobile Computing Environments

Cited by 13 publications

References 11 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 Efficient Cache Replacement Strategy in Mobile Cooperative Caching

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

Contact Info

Product

Resources

About