Filters








26,207 Hits in 8.2 sec

Distributed Caching Strategies in Peer-to-Peer Systems

Guoqiang Gao, Ruixuan Li, Weijun Xiao, Zhiyong Xu
2011 2011 IEEE International Conference on High Performance Computing and Communications  
However, due to its autonomous nature, a fully distributed caching scheme is very difficult to design and implement.  ...  In this paper, we investigate the techniques for efficient distributed P2P caching. We propose novel placement and replacement algorithms to make caching decisions.  ...  These traditional cache replacement algorithms do not work very well. A popular file could have a large number of cached copies and not all of them will be used for future queries.  ... 
doi:10.1109/hpcc.2011.11 dblp:conf/hpcc/GaoLXX11 fatcat:fwmu37jkavbs3dzdfow74wl274

Caching Scheme Research Based on Unstructured Peer-to-Peer Network

Xueying Jiang, Pengfei Gao, Yuhui Zhao, Yingjin Shi
2012 Physics Procedia  
This paper proposed a new cache scheme MFU (Most Frequently Used) that replaces the cache on the basis of the number of request messages per unit of time.  ...  For Unstructured P2P (Peer-to-Peer) networks leading to the high-load of "high-degree peers " and the quick deletion of rarely requested contents.  ...  In contrast, the use MFU strategy, long-term high-degree node will hold short-term unpopular contents. Thus, MFU's hit rate is the highest.  ... 
doi:10.1016/j.phpro.2012.03.202 fatcat:edory3ye3rgenjyhsvih2k5zga

Analysis of the ECMWF Storage Landscape

Matthias Grawinkel, Lars Nagel, Markus Mäsker, Federico Padua, André Brinkmann, Lennart Sorth
2015 USENIX Conference on File and Storage Technologies  
We have built a caching simulator to examine the efficiency of disk caches for various cache sizes and algorithms, and we investigate the potential of tape prefetching strategies.  ...  We analzye the system's log files to characterize traffic and user behavior, metadata snapshots to identify the current content of the storage systems, and logs of tape libraries to investigate cartridge  ...  Only for very large caches, they yield an acceptable hit ratio.  ... 
dblp:conf/fast/GrawinkelNMPBS15 fatcat:tanpq3uv35ajfncl7cu4l6uhyq

Mobility-aware caching for content-centric wireless networks: modeling and methodology

Rui Wang, Xi Peng, Jun Zhang, Khaled B. Letaief
2016 IEEE Communications Magazine  
Key properties of user mobility patterns that are useful for content caching will be firstly identified, and then different design methodologies for mobility-aware caching will be proposed.  ...  In this paper, we present a general framework on mobility-aware caching in CCWNs.  ...  on long-term system information and is used to determine how to effectively pre-cache content in the available storage.  ... 
doi:10.1109/mcom.2016.7537180 fatcat:hk7bgahjqvhabhwzxqrphz4e3u

Mean-Field Game Theoretic Edge Caching in Ultra-Dense Networks [article]

Hyesung Kim, Jihong Park, Mehdi Bennis, Seong-Lyun Kim, Mérouane Debbah
2018 arXiv   pre-print
This paper investigates a cellular edge caching problem under a very large number of small base stations (SBSs) and users.  ...  Numerical evaluations validate that the proposed caching algorithm reduces not only the long run average cost of the network but also the redundant cached data respectively by 24% and 42%, compared to  ...  Instead, the caching strategy design of a UDCN calls for a spatio-temporal user demand model that captures: long-term content popularity correlation and short-term popularity fluctuations, as well as the  ... 
arXiv:1801.07367v2 fatcat:mmdkvdo7svb5hkcmsmy3nubh5q

Analysis and modeling of data access patterns in ATLAS and CMS

CMS Collaboration And CERN/IT, Andrea SciabÃ, Markus Schulz, Victoria Matskovskaya
2019 Zenodo  
Data movement between sites, replication and storage are very expensive operations, in terms of time and resources, for the LHC collaborations, and are expected to be even more so in the future.  ...  For selected sites, this data has been augmented by access logs from the local storage system to also include data accesses not managed via the standard experiments workflow management systems.  ...  and calibration tasks • Very different distributions for production and analysis ○ Assuming that caches are needed only for analysis, the only relevant data tiers are (MINI)AOD(SIM) ○ NANOAOD's  ... 
doi:10.5281/zenodo.3598836 fatcat:bhch2gwtkjaytphnu6qui53usm

Enabling Mobile Peer-to-Peer Networking [chapter]

Jens O. Oberender, Frank-Uwe Andersen, Hermann de Meer, Ivan Dedinski, Tobias Hoßfeld, Cornelia Kappler, Andreas Mäder, Kurt Tutschku
2005 Lecture Notes in Computer Science  
In this paper we present a P2P file-sharing architecture optimized for mobile networks.  ...  The architecture is based on the popular eDonkey protocol and is enhanced by additional caching entities and a crawler.  ...  For a scenario with a more complex file size distribution, e.g. several large files, the LFU cannot return as good results as IMU, because a large, popular file may not be cached, although it produces  ... 
doi:10.1007/978-3-540-31963-4_16 fatcat:xsh6p265fjh4fj724v3nnttkxq

Positioning Dynamic Storage Caches for Transient Data

Sudharshan S. Vazhkudai, Douglas Thain, Xiaosong Ma, Vincent W. Freeh
2006 2006 IEEE International Conference on Cluster Computing  
In order to sustain and maximize I/O bandwidth relative to increasing CPU speeds, applications must take advantage of large amounts of intermediate commodity storage, However, intermediate storage presents  ...  new challenges above and beyond the traditional distributed filesystem paradigm: persistent scheduling, storage/CPU coallocation, namespace management, lifetime management, and novel application interfaces  ...  Mass storage provides the large capacity and long-term storage space for safely archiving bulk datasets.  ... 
doi:10.1109/clustr.2006.311900 dblp:conf/cluster/VazhkudaiTMF06 fatcat:crlajnv54rf3jjfhkbbgrtp4se

An Intersection Cache Based on Frequent Itemset Mining in Large Scale Search Engines

Wanwan Zhou, Ruixuan Li, Xinhua Dong, Zhiyong Xu, Weijun Xiao
2015 2015 Third IEEE Workshop on Hot Topics in Web Systems and Technologies (HotWeb)  
Caching is an effective optimization in large scale web search engines, which is to reduce the underlying I/O burden of storage systems as far as possible by leveraging cache localities.  ...  Result cache and posting list cache are popular used approaches. However, they cannot perform well with long queries.  ...  In the process of offline selection of the intersection data, the offline Greedy strategy needs to consume a tremendous long time for a large amount of training data though the analysis is off-line.  ... 
doi:10.1109/hotweb.2015.17 dblp:conf/hotweb/ZhouLDXX15 fatcat:j7tgqlqflfbfjmshlpt53dfjsy

Design and Analysis of Low Delay Deterministic Network Based on Data Mining Association Analysis

Jianhu Gong
2021 Journal of Web Engineering  
The prefetch performance when cache hits is better than that when cache fails and the cache fails to hit has better performance.  ...  In the case of a certain size of cache space, reasonable organization of cache space can further improve the cache hit rate and reduce the network delay.  ...  To this end, the test results of the number of log records and the number of sessions of the training set and the test set are selected from short-term data, mid-term data, and long-term data for reference  ... 
doi:10.13052/jwe1540-9589.20213 fatcat:3nx37yhqzzfe5nnq3bxz264ry4

Position paper

Carsten Griwodz, Michael Zink, Michael Liepert, Ralf Steinmetz
1999 Proceedings of the seventh ACM international conference on Multimedia (Part 2) - MULTIMEDIA '99  
We think that web caches will soon have to better support multimedia demands. In this paper we present a cache server design for internet video on demand (VoD) systems.  ...  Current internet caching strategies can remain rather simple, since the assumption of a large cache and small data items is valid for the vast part of web traffic.  ...  very small, these caches are mainly streamlined for simplicity and thus rapid request answers [1] . • Support the delivery of large bulk data files across networks with resource guarantees. • Evaluate  ... 
doi:10.1145/319878.319911 dblp:conf/mm/GriwodzZLS99 fatcat:3ah63tdfavcalibvh4ylygirpe

The influence of scale on distributed file system design

M. Satyanarayanan
1992 IEEE Transactions on Software Engineering  
This paper uses Andrew and Coda, distributed file systems built at Carnegie Mellon University, to validate this proposition.  ...  Scale should be recognized as a primary factor influencing the architecture and implementation of distributed systems.  ...  Caching of whole files, or large chunks of files, is not a viable design strategy for such machines.  ... 
doi:10.1109/32.120311 fatcat:ucixxxpvtzgmbjxwddeygfrfw4

The effect of client caching on file server workloads

K.W. Froese, R.B. Bunt
1996 Proceedings of HICSS-29: 29th Hawaii International Conference on System Sciences  
A distributed file systetn provides file service from one or rnore &red file servers to a community of clierit workstations o'ver Q network.  ...  Some recent research has suggested that various strategies for cache rnauagernent may not be equally suited to the circurnstances at both the client and the server.  ...  Acknowledgements The authors would like to thank Michael Molloy, from Hewlett-Packard, for providing technical assistance and several tools used to instrument the HP-UX 8.0 operating system.  ... 
doi:10.1109/hicss.1996.495458 dblp:conf/hicss/FroeseB96 fatcat:rerj6byqtvhxdd73ypoxknd3wy

Transparent disconnected operation for fault-tolerance

James Jay Kistler, M. Satyanarayanan
1991 ACM SIGOPS Operating Systems Review  
Since clients already cache objects in many distributed file systems for performance reasons, it makes sense to overload this function for fault-tolerance.  ...  Coda, a descendant of the Andrew file system (AFS) [4] , provides users with shared file access in a large-scale Unix 1 workstation environment.  ... 
doi:10.1145/122140.122150 fatcat:r3hzgrvxj5g43clbg6i2l56ley

A Practical Approach of Application Level Caching for Increase E-Business Performance
IJARCCE - Computer and Communication Engineering

SHAI NA, MRS. ANSHU KAMBOJ
2014 IJARCCE  
For many web applications system support for caching is insufficient. This Paper provides a new way of Application level caching to improve performance of web applications.  ...  Today, the E-Business faces the many problems in terms of efficiency, reliability because of large data has been placed on the servers and the client are using such data at the same and frequently and  ...  However, in contrast to most distributed file systems, document transfer services usually incorporate simple caching strategies, if any, and do not typically provide location transparency.  ... 
doi:10.17148/ijarcce.2014.31010 fatcat:icdorrge55h4vidwz2kyuhx7wi
« Previous Showing results 1 — 15 out of 26,207 results