Proactive cache replacement technique for mobile networks based on genetic programming. Issue 6 (1st November 2018)

• Record Type: Journal Article
• Authors: Darwish, Saad M.; El‐Zoghabi, Adel; El‐Shnawy, Amr G.
• Is Part Of: IET networks. Volume 7:Issue 6(2018)
• Page Start: 376
• Page End: 383
• Publication Date: 2018-11-01
• Subjects: cache storage -- mobile computing -- document handling -- database management systems -- genetic algorithms; proactive cache replacement technique -- mobile environment -- caching -- client cache policy -- cache invalidation method -- cache replacement method -- cached item -- cached document size -- mobile networks -- genetic programming -- users movement -- disconnected modes -- many data updates -- power battery consumption -- limited cache size -- limited bandwidth -- information access -- mobile database -- data availability -- cache like access probability -- validation time -- network simulator 2; Computer network architectures -- Periodicals; Computer network protocols -- Periodicals; Information networks -- Periodicals; Telecommunication systems -- Periodicals; 004.605
• DOI: 10.1049/iet-net.2017.0261
• Languages: English
• ISSNs: 2047-4954

Abstract

Abstract : 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.