By Topic

Optimal callback with two-level adaptation for wireless data access

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
Yang Xiao ; Dept. of Comput. Sci., Alabama Univ., Tuscaloosa, AL ; Hui Chen

Strongly consistent callback cache mechanisms have been studied for data access in wireless networks. In cache access mechanisms, update information is extremely important since an updated data object in a remote server makes the corresponding data objects invalidated in mobile terminals (MTs), and the data object cache hit information in those MTs becomes almost useless. In this paper, we propose an adaptive access mechanism, called optimal callback with two-level adaptation. In the first-level adaptation, cache size in an MT is adaptively adjusted based on update-to-access-ratio (UAR), defined as the average number of updates per data object access. The range of the cache size is [O, M], where M is the maximum physical cache size of the MT. Two extreme cases are given as follows: 1) when the UAR is very large so that objects in the cache are always obsolete, the cache should not be used and, therefore, the cache size should be set to zero; 2) when the UAR is zero so that every object in the cache is valid, the cache size should be set to M. Under other situations, the cache size is dynamically changed between O and M. Define U-threshold of the UAR for any object, a particular important threshold, as a UAR value, beyond which the object should be not cached at all. The idea of the second-level adaptation is that if an object size is small, sending back the object may be a better choice than sending back an invalidation message when the object is updated. Therefore, when an object is updated at the server, it is sent directly to MTs if the object size is smaller than a threshold, called push threshold (T); otherwise, an invalidation message is sent to the MTs. We analytically model cost function for the proposed adaptive scheme as the total traffic involved between the server and an MT per data object access, and the optimal cache size and the optimal T value are obtained simultaneously to minimize the cost function. Furthermore, U-threshold is derived analytically.- - Both simulations and analytical results are used to study and compare the performance of the proposed scheme with several others under many different scenarios

Published in:

Mobile Computing, IEEE Transactions on  (Volume:5 ,  Issue: 8 )