Welcome to the ADMT Publication Server

Towards Universal Mobile Caching

DocUID: 2005-010 Full Text: PDF

Author: Ganesh Santhanakrishnan, Ahmed Amer, Panos K. Chrysanthis

Abstract: In the context of mobile data access, data caching is fundamental for both performance and functionality. For this reason there have been many studies into developing energy-efficient caching algorithms suitable for specific mobile environments. In this papers, we present a novel caching policy, Universal Mobile Caching (UMC), which is suitable for managing object caches in structurally varying environments, and which is self-optimizing for changing workloads. UMC is based on a simple set of basic criteria which reflect a spectrum of possible caching policies. UMC has demonstrated the ability to provide caching benefits in the on-demand retrieval of web documents for the mobile web, wherein multiple levels of intervening caches can create adverse workloads for other general caching schemes. When considering the energy expended in servicing cache misses, UMC consistently demonstrated savings on the order of 10% to 15%. These energy savings are solely due to local per-node behavior, and do not include the potential reduction of power consumption, to less than half its normal levels, achievable due its enabling more effective multi-hop data transmission.

Published In: Proc. of the 4th ACM Int'l Workshop on Data Engineering for Wireless and Mobile Access

ISBN: 1-59593-088-4

Pages: pp. 73-80

Place Published: Baltimore, MD

Year Published: 2005

Note: held in conjunction with the ACM SIGMOD 2005 Conference, DOI:10.1145/1065870.1065883

Project: Others Subject Area: Mobile Databases, Caching

Publication Type: Conference Paper

Sponsor: NSF ITR ANI-0325353, NSF ANI-0123705

Citation:Text Latex BibTex XML Ganesh Santhanakrishnan, Ahmed Amer, and Panos K. Chrysanthis. Towards Universal Mobile Caching, Proc. of the 4th ACM Int'l Workshop on Data Engineering for Wireless and Mobile Access (MobiDE'05), pp. 73-80, 1-59593-088-4, Baltimore, MD, June 2005.(held in conjunction with the ACM SIGMOD 2005 Conference, DOI:10.1145/1065870.1065883)