Simplifying automated hoarding methods

  • Authors:
  • Geoffrey H. Kuenning;Wilkie Ma;Peter Reiher;Gerald J. Popek

  • Affiliations:
  • Harvey Mudd College, Claremont, CA;UCLA, Los Angeles, CA;UCLA, Los Angeles, CA;UCLA, Los Angeles, CA

  • Venue:
  • MSWiM '02 Proceedings of the 5th ACM international workshop on Modeling analysis and simulation of wireless and mobile systems
  • Year:
  • 2002

Quantified Score

Hi-index 0.00

Visualization

Abstract

A number of mobile computing systems have used the technique of hoarding, which allows a mobile device to store a chosen subset of known files, to give disconnected users the illusion of a complete filesystem in the presence of limited storage. We undertook an extensive and detailed simulation study of the parameters of a well-known hoarding system, seer, in an attempt to discover the parameters that would produce the best performance. To our surprise, we discovered that the best parameter combinations were those that completely disabled seer's complex clustering methods, reverting the system instead to a modified form of LRU hoarding. We discuss the experiments and our results, and propose designs for future systems and directions for future research.