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.
An Energy Aware Strategy for Distributed Cache Discovery with Stale Page Reduction
