A Strategy to Manage Cache Consistency in a Distributed Mobile Wireless Environment

Mobile computing environments are characterized by slow wireless links and relatively underprivileged hosts with limited battery powers, predisposed to frequent disconnections. Caching data at the mobile hosts (MHs) in a wireless network helps alleviate problems associated with slow, limited bandwidth wireless links, by reducing latency and conserving bandwidth. Battery power is conserved by reducing the number of up-link requests. A mobile computing environment is a distributed system, thus when data at the server changes, the client hosts must be made aware of this fact in order for them to invalidate their cache otherwise the host would continue to answer queries with the cached values returning incorrect data. The nature of the physical medium coupled with the fact that disconnections from the network are very frequent in mobile computing environments demand a cache invalidation strategy with minimum possible overheads. In this paper, we present a new cache maintenance scheme, called AS. The objective of the proposed scheme is to minimize the overhead for the MHs to validate their cache upon reconnection, to allow stateless servers, and to minimize the bandwidth requirement. The general approach is i) to use asynchronous invalidation messages, and ii) to buffer invalidation messages from servers at the MH’s Home Location Cache (HLC) while the MH is disconnected from the network and redeliver these invalidation messages to the MH when it gets reconnected to the network. Use of asynchronous invalidation messages minimizes access latency, buffering of invalidation messages minimizes the overhead of validating MH’s cache after each disconnection and use of HLC off-loads the overhead of maintaining state of MH’s cache from the servers. The MH can be disconnected from the server either voluntarily (e.g. switching off the laptop) or involuntarily (e.g. wireless link failure, handoff delay); we capture the effects of both by using a single parameter s: the percentage of time a mobile host is disconnected from the network. We demonstrate the efficiency of our scheme through simulation and performance modeling. In particular, we show that the average data access latency and the number of up-link requests by a MH decrease by using the proposed strategy at the cost of using buffer space at the HLC. We provide analytical comparison between our proposed scheme and the existing scheme for cache management in a mobile environment [BI95]. Extensive experimental results are provided to compare the schemes in terms of performance metrics like latency, number of up-link requests etc. under both high and low rate of change of data at servers for various values of the parameter s. A mathematical model for the scheme is developed which matches closely with the simulation results.

[1]  Tomasz Imielinski,et al.  Sleepers and workaholics: caching strategies in mobile environments , 1994, SIGMOD '94.

[2]  Tomasz Imielinski,et al.  Mobile wireless computing: challenges in data management , 1994, CACM.

[3]  Vaduvur Bharghavan,et al.  Alleviating the Latency and Bandwidth Problems in WWW Browsing , 1997, USENIX Symposium on Internet Technologies and Systems.

[4]  Raj Jain,et al.  The art of computer systems performance analysis - techniques for experimental design, measurement, simulation, and modeling , 1991, Wiley professional computing.

[5]  Rafael Alonso,et al.  Database system issues in nomadic computing , 1993, SIGMOD Conference.

[6]  Charles E. Perkins,et al.  IP Mobility Support , 1996, RFC.

[7]  Mahadev Satyanarayanan,et al.  Variable granularity cache coherence , 1994, OPSR.

[8]  Mahadev Satyanarayanan,et al.  Coda: A Highly Available File System for a Distributed Workstation Environment , 1990, IEEE Trans. Computers.

[9]  Gerald Q. Maguire,et al.  A mobility-aware dynamic database caching scheme for wireless mobile computing and communications , 1996 .

[10]  Ouri Wolfson,et al.  Competitive Analysis of Caching in Distributed Databases , 1998, IEEE Trans. Parallel Distributed Syst..

[11]  William I. Nowicki,et al.  NFS: Network File System Protocol specification , 1989, RFC.

[12]  Philip S. Yu,et al.  Energy-efficient caching for wireless mobile computing , 1996, Proceedings of the Twelfth International Conference on Data Engineering.

[13]  Kevin Wilkinson,et al.  Maintaining Consistency of Client-Cached Data , 1990, VLDB.

[14]  Paul Barford,et al.  The network effects of prefetching , 1998, Proceedings. IEEE INFOCOM '98, the Conference on Computer Communications. Seventeenth Annual Joint Conference of the IEEE Computer and Communications Societies. Gateway to the 21st Century (Cat. No.98.

[15]  Ahmed K. Elmagarmid,et al.  Bit-Sequences: A New Cache Invalidation Method in Mobile Environments , 1995 .

[16]  A. Prasad Sistla,et al.  Minimization of Communication Cost Through Caching in Mobile Environments , 1998, IEEE Trans. Parallel Distributed Syst..

[17]  Mahadev Satyanarayanan,et al.  Large Granularity Cache Coherence for Intermittent Connectivity , 1994, USENIX Summer.

[18]  Mahadev Satyanarayanan,et al.  Scalable, secure, and highly available distributed file access , 1990, Computer.

[19]  Geoffrey H. Kuenning,et al.  Automated hoarding for mobile computers , 1997, SOSP.

[20]  Michael L. Kazar,et al.  Synchronization and Caching Issues in the Andrew File System , 1988, USENIX Winter.

[21]  Rafael Alonso,et al.  Data caching issues in an information retrieval system , 1990, TODS.

[22]  Ahmed K. Elmagarmid,et al.  Bit-Sequences: An adaptive cache invalidation method in mobile client/server environments , 1997, Mob. Networks Appl..

[23]  Ouri Wolfson,et al.  A competitive dynamic data replication algorithm , 1993, Proceedings of IEEE 9th International Conference on Data Engineering.

[24]  Robert W. Brodersen,et al.  A Portable Multimedia Terminal for Personal Communications , 1992 .