Simulation of client-side caching policies for distributed file systems

Cache as an intermediate component serves for storing content which has been requested by user and will be potentially used in the future. The cache capacity is limited, thus we cannot store all requested content. We have to use algorithms which mark an old content to be replaced in the cache. These algorithms are commonly named cache or caching policies. Optimally, the caching policy should replace the content which will not be used in the near future. First goal of this paper is to present a cache simulator which serves for comparison of caching policies. In a simulation, requests for data are produced by random request generator or can be generated from a log file. The second goal of this paper is to present results gained from simulations of different caching policies applicable to mobile devices and other clients in order to choose most suitable one.

[1]  Richard B. Bunt,et al.  The effect of client caching on file server workloads , 1996, Proceedings of HICSS-29: 29th Hawaii International Conference on System Sciences.

[2]  Zhiqian Xu,et al.  HASS: Highly Available, Scalable and Secure Distributed Data Storage Systems , 2009, 2009 International Conference on Computational Science and Engineering.

[3]  Remzi Seker,et al.  JigDFS: A secure distributed file system , 2009, 2009 IEEE Symposium on Computational Intelligence in Cyber Security.

[4]  Sang Lyul Min,et al.  LRFU: A Spectrum of Policies that Subsumes the Least Recently Used and Least Frequently Used Policies , 2001, IEEE Trans. Computers.

[5]  Jirí Safarík,et al.  Distributed File System with Online Multi-master Replicas , 2011, 2011 Second Eastern European Regional Conference on the Engineering of Computer Based Systems.

[6]  Azzedine Boukerche,et al.  Towards building a fault tolerant and conflict-free distributed file system for mobile clients , 2006, 20th International Conference on Advanced Information Networking and Applications - Volume 1 (AINA'06).

[7]  Gerhard Weikum,et al.  The LRU-K page replacement algorithm for database disk buffering , 1993, SIGMOD Conference.

[8]  R. Tobbicke.  Distributed file systems: focus on Andrew File System/Distributed File Service (AFS/DFS) , 1994, Proceedings Thirteenth IEEE Symposium on Mass Storage Systems. Toward Distributed Storage and Data Management Systems.

[9]  Yang Xiao,et al.  Update-Based Cache Access and Replacement in Wireless Data Access , 2006, IEEE Transactions on Mobile Computing.

[10]  Song Jiang,et al.  CLOCK-Pro: An Effective Improvement of the CLOCK Replacement , 2005, USENIX ATC, General Track.

[11]  Pavel Bzoch,et al.  Design and Implementation of a Caching Algorithm Applicable to Mobile Clients , 2012, Informatica.

[12]  Jianliang Xu,et al.  Performance evaluation of an optimal cache replacement policy for wireless data dissemination , 2004, IEEE Transactions on Knowledge and Data Engineering.

[13]  Darrell D. E. Long,et al.  Analysis of caching algorithms for distributed file systems , 1996, OPSR.

[14]  A. Kumar,et al.  A new cache replacement policy for location dependent data in mobile environment , 2006, 2006 IFIP International Conference on Wireless and Optical Communications Networks.

[15]  Wolfgang Effelsberg,et al.  Principles of database buffer management , 1984, TODS.

[16]  Song Jiang,et al.  LIRS: an efficient low inter-reference recency set replacement policy to improve buffer cache performance , 2002, SIGMETRICS '02.

[17]  Li Fan,et al.  Web caching and Zipf-like distributions: evidence and implications , 1999, IEEE INFOCOM '99. Conference on Computer Communications. Proceedings. Eighteenth Annual Joint Conference of the IEEE Computer and Communications Societies. The Future is Now (Cat. No.99CH36320).

[18]  Irving L. Traiger,et al.  Evaluation Techniques for Storage Hierarchies , 1970, IBM Syst. J..

[19]  Fang Liu,et al.  Dual queues cache replacement algorithm based on sequentiality detection , 2011, Science China Information Sciences.

[20]  Christian Cachin,et al.  Cryptographic Security for a High-Performance Distributed File System , 2007, 24th IEEE Conference on Mass Storage Systems and Technologies (MSST 2007).

[21]  Laszlo A. Belady,et al.  An anomaly in space-time characteristics of certain programs running in a paging machine , 1969, CACM.

[22]  Yuanyuan Zhou,et al.  The Multi-Queue Replacement Algorithm for Second Level Buffer Caches , 2001, USENIX Annual Technical Conference, General Track.

[23]  Chung-Horng Lung,et al.  Experiments of Large File Caching and Comparisons of Caching Algorithms , 2008, 2008 Seventh IEEE International Symposium on Network Computing and Applications.

[24]  Dennis Shasha,et al.  2Q: A Low Overhead High Performance Buffer Management Replacement Algorithm , 1994, VLDB.

[25]  David J. DeWitt,et al.  An evaluation of buffer management strategies for relational database systems , 1986, Algorithmica.

[26]  Renu Tewari,et al.  C2Cfs: A Collective Caching Architecture for Distributed File Access , 2009, 2009 11th IEEE International Conference on High Performance Computing and Communications.

[27]  Pavel Bzoch,et al.  Towards caching algorithm applicable to mobile clients , 2012, 2012 Federated Conference on Computer Science and Information Systems (FedCSIS).

[28]  Richard Draves,et al.  Page Replacement and Reference Bit Emulation in Mach , 1991, USENIX MACH Symposium.

[29]  Nimrod Megiddo,et al.  ARC: A Self-Tuning, Low Overhead Replacement Cache , 2003, FAST.

[30]  Qiongxin Liu,et al.  Dynamic Data Replication Based on Access Cost in Distributed Systems , 2009, 2009 Fourth International Conference on Computer Sciences and Convergence Information Technology.