ACM Home Page
Please provide us with feedback. Feedback
Simplifying automated hoarding methods
Full text PdfPdf (148 KB)
Source International Workshop on Modeling Analysis and Simulation of Wireless and Mobile Systems archive
Proceedings of the 5th ACM international workshop on Modeling analysis and simulation of wireless and mobile systems table of contents
Atlanta, Georgia, USA
SESSION: Mobility, Modeling, and Management table of contents
Pages: 15 - 21  
Year of Publication: 2002
ISBN:1-58113-610-2
Authors
Geoffrey H. Kuenning  Harvey Mudd College, Claremont, CA
Wilkie Ma  UCLA, Los Angeles, CA
Peter Reiher  UCLA, Los Angeles, CA
Gerald J. Popek  UCLA, Los Angeles, CA
Sponsors
ACM: Association for Computing Machinery
SIGMOBILE: ACM Special Interest Group on Mobility of Systems, Users, Data and Computing
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 2,   Downloads (12 Months): 16,   Citation Count: 4
Additional Information:

abstract   references   cited by   index terms   collaborative colleagues  

Tools and Actions: Request Permissions Request Permissions    Review this Article  
DOI Bookmark: Use this link to bookmark this Article: http://doi.acm.org/10.1145/570758.570762
What is a DOI?

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.


REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

 
1
Rafael Alonso, Daniel Barbará, and Luis L. Cova. Using stashing to increase node autonomy in distributed file systems. In Proceedings of the Ninth IEEE Symposium on Reliability in Distributed Software and Database Systems, pages 12--21, October 1990.
2
 
3
Peter Honeyman, Larry Huston, Jim Rees, and Dave Bachmann. The Little Work project. In Proceedings of the Third Workshop on Workstation Operating Systems, pages 11--14. IEEE, April 1992.
 
4
L. B. Huston and Peter Honeyman. Disconnected operation for AFS. In Proceedings of the USENIX Symposium on Mobile and Location-Independent Computing, pages 1--10. USENIX, 1993.
 
5
R. A. Jarvis and E. A. Patrick. Clustering using a similarity measure based on shared near neighbors. IEEE Transactions on Computers, C-22(11):1025--1034, November 1973.
 
6
James Jay Kistler. Disconnected Operation in a Distributed File System. Ph.D. dissertation, Carnegie-Mellon University, May 1993.
7
 
8
Geoffrey H. Kuenning, Peter Reiher, and Gerald J. Popek. Experience with an automated hoarding system. Personal Technologies, 1(3):145--155, September 1997.
 
9
Geoffrey Houston Kuenning. Seer: Predictive File Hoarding for Disconnected Mobile Operation. PhD thesis, University of California, Los Angeles, Los Angeles, CA, May 1997. Also available as UCLA CSD Technical Report UCLA-CSD-970015.
10
 
11
12


Collaborative Colleagues:
Geoffrey H. Kuenning: colleagues
Wilkie Ma: colleagues
Peter Reiher: colleagues
Gerald J. Popek: colleagues