Access Restriction

Author Barbará, Daniel ♦ Imieliński, Tomasz
Source ACM Digital Library
Content type Text
Publisher Association for Computing Machinery (ACM)
File Format PDF
Language English
Subject Domain (in DDC) Computer science, information & general works ♦ Computer programming, programs & data
Abstract In the mobile wireless computing environment of the future a large number of users equipped with low powered palm-top machines will query databases over the wireless communication channels. Palmtop based units will often be disconnected for prolonged periods of time due to the battery power saving measures; palmtops will also frequencly relocate between different cells and connect to different data servers at different times. Caching of frequently accessed data items will be an important technique that will reduce contention on the narrow bandwidth wireless channel. However, cache invalidation strategies will be severely affected by the disconnection and mobility of the clients. The server may no longer know which clients are currently residing under its cell and which of them are currently on. We propose a taxonomy of different cache invalidation strategies and study the impact of client's disconnection times on their performance. We determine that for the units which are often disconnected (sleepers) the best cache invalidation strategy is based on signatures previously used for efficient file comparison. On the other hand, for units which are connected most of the time (workaholics), the best cache invalidation strategy is based on the periodic broadcast of changed data items.
Description Affiliation: Rutgers University, Department of Computer Science, New Brunswick, N.J (Imieliński, Tomasz) || Matsushita Information Technology Laboratory, 2 Research Way, 3rd Floor, Princeton, N.J (Barbará, Daniel)
Age Range 18 to 22 years ♦ above 22 year
Educational Use Research
Education Level UG and PG
Learning Resource Type Article
Publisher Date 1999-06-01
Publisher Place New York
Journal ACM SIGMOD Record (SGMD)
Volume Number 23
Issue Number 2
Page Count 12
Starting Page 1
Ending Page 12

Open content in new tab

   Open content in new tab
Source: ACM Digital Library