Jin Jing
Ahmed Elmagarmid
Abstract
In this paper, we present Bit-Sequences (BS), an adaptive cache invalidation algorithm for client/server mobile environments. The algorithm uses adaptable mechanisms to adjust the size of the invalidation report to optimize the use of a limited communication bandwidth while retaining the effectiveness of cache invalidation. The proposed BS algorithm is especially suited for dissemination-based (or “server-push”-based) nomadic information service applications. The critical aspect of our algorithm is its self-adaptability and effectiveness, regardless of the connectivity behavior of the mobile clients. The performance of BS is analyzed through a simulation study that compares BS's effectiveness with that of a hypothetical optimal cache invalidation algorithm.
- 1 S. Acharya, R. Alonso, M. Franklin and S. Zdonik, Broadcast disks: Data management for asymmetric communications environments, in: Proceedings of the ACM SIGMOD Conference on Management of Data, San Jose, California (1995). Google Scholar
Cross Ref
- 2 S. Acharya, M. Franklin and S. Zdonik, Disseminating updates on broadcast disks, in: Proceedings of VLDB, Bombay, India (1996). Google Scholar
- 3 B.R. Badrinath, A. Acharya and T. Imielinski, Structuring distrib-uted algorithms for mobile hosts, in: Proceedings of 14th Inter-national Conference on Distributed Computing Systems, Poznan, Poland (June 1994).Google Scholar
- 4 D. Barbar~ a and T. Imielinski, Adaptive stateless caching in mobile environments: An example, Technical Report MITL-TR-60-93, Mat-sushita Information Technology Laboratory (1993).Google Scholar
- 5 D. Barbar~ a and T. Imielinski, Sleepers and workaholics: Caching strategies for mobile environments, in: Proceedings of the ACM SIGMOD Conference on Management of Data (1994) pp. 1-12. Google Scholar
- 6 D. Barbar~ a and T. Imielinski, Sleepers and workaholics: Caching strategies for mobile environments (extended version), MOBIDATA: An Interactive Journal of Mobile Computing 1(1) (November 1994). Available through the WWW, http://rags.rutgers.edu/journal/ cover.html.Google Scholar
- 7 M.J. Franklin, Caching and memory management in client-server database systems, Ph.D. Thesis, University of Wisconsin-Madison (1993). Google Scholar
- 8 Y. Huang, P. Sistla and O. Wolfson, Data replication for mobile computers, in: Proceedings of the ACM SIGMOD Conference on Management of Data, Minneapolis, Minnesota (1994). Google ScholarDigital Library
- 9 T. Imielinski and B.R. Badrinath, Wireless mobile computing: Chal-lenges in data management, Communication of ACM 37(10) (1994). Google Scholar
- 10 T. Imielinski and S. Vishwanath, Adaptive wireless information sys-tems, in: Proceedings of SIGDBS (Special Interest Group in Data-Base Systems) Conference, Tokyo, Japan (1994).Google Scholar
- 11 T. Imielinski, S. Vishwanath and B.R. Badrinath, Energy efficient indexing on air, in: Proceedings of the ACM SIGMOD Conference on Management of Data, Minneapolis, Minnesota (1994). Google ScholarDigital Library
- 12 T. Imielinski, S. Vishwanath and B.R. Badrinath, Power efficient filtering of data on the air, in: Proceedings of the International Conference of EDBT (Extending DataBase Technology) (1994). Google ScholarCross Ref
- 13 J. Jing, Data consistency management in wireless client-server in-formation systems, Ph.D. Thesis, Purdue University (1996). Google Scholar
- 14 SAS User's Guide (SAS Insititute Inc., Cary, NC, 1989).Google Scholar
- 15 H. Schwetman, Csim User's Guide (Version 16) (MCC Corporation, 1992).Google Scholar
- 16 S. Vishwanath and T. Imielinski, Pyramid broadcasting for video on demand service, in: Proceedings of the IEEE Multimedia Computing and Networks Conference, San Jose, California (1995).Google Scholar
- 17 K. Wu, P. Yu and M. Chen, Energy-efficient caching for wireless mobile computing, in: Proceedings of the IEEE Data Engineering Conference (1996). Google Scholar
Index Terms
Bit-sequences: an adaptive cache invalidation method in mobile client/server environments
Recommendations
Modeling and Analysis of The Difference-Bit Cache
GLS '98: Proceedings of the Great Lakes Symposium on VLSI '98Advances in VLSI technology and processor architectures have resulted in a tremendous increase in processor speeds and memory capacities. However memory latencies have failed to improve as rapidly, making memory systems the performance bottlenecks in ...
The difference-bit cache
ISCA '96: Proceedings of the 23rd annual international symposium on Computer architectureThe difference-bit cache is a two-way set-associative cache with an access time that is smaller than that of a conventional one and close or equal to that of a direct-mapped cache. This is achieved by noticing that the two tags for a set have to differ ...
The difference-bit cache
Special Issue: Proceedings of the 23rd annual international symposium on Computer architecture (ISCA '96)The difference-bit cache is a two-way set-associative cache with an access time that is smaller than that of a conventional one and close or equal to that of a direct-mapped cache. This is achieved by noticing that the two tags for a set have to differ ...
Reviews
Marie Jeanne Helene Iordache
An adaptive cache invalidation algorithm for client/server mobile environments is presented. In this algorithm, a periodically broadcast invalidation report is organized as a set of binary bit-sequences with a set of associated timestamps. This algorithm, called the BS algorithm for short, is suited for mobile and wireless environments, in which caching of frequently accessed data is critical for reducing contention on the narrow bandwidth channels. The BS algorithm uses three principal techniques: the bit sequence technique, for referencing data items in the report; the update aggregation technique, which groups a set of data items and associates the set with only one timestamp in the report; and the hierarchical structure of bit sequences technique, which links a set of bit sequences. The paper is divided into seven sections and an appendix. Section 1 introduces the concepts and techniques covered. Section 2 describes the BS algorithm (the caching management model; optimization techniques; and a description of the BS algorithm and its invalidation precision). Section 3 covers the relationship between invalidation effectiveness and bitmapping in the use of the BS algorithm. Two bitmapping schemas that define two different effectiveness requirements are presented, and the report size for each mapping schema is analyzed. In section 4, the authors examine how the BS algorithm compares to the hypothetical “optimal” algorithm for cache invalidation under different workload parameters, such as disconnect time, query/update pattern, and client buffer size. Sections 5 and 6, respectively, contain a discussion of related research and the authors' concluding remarks. Appendix A contains a probability analysis of the false alarm in the SIG algorithm. A long list of references, most of them conference papers on the subject, along with a short presentation related to each contribution , end the paper. The authors deliver a clear presentation of technical aspects of mobile communications, an important topic today. Though not lengthy, the paper includes many examples and short analyses that help explain the subject, as well as seven figures that graphically illustrate the BS algorithm's performance. For those who want to study the results of the algorithm, the authors provide some principal formulas and tables of parameter settings. I recommend the paper to everyone who needs to keep up with new developments in communications and networking.
Access critical reviews of Computing literature here
Become a reviewer for Computing Reviews.
Comments