Scale and performance in a distributed file system
ACM Transactions on Computer Systems (TOCS)
OceanStore: an architecture for global-scale persistent storage
ASPLOS IX Proceedings of the ninth international conference on Architectural support for programming languages and operating systems
Storage management and caching in PAST, a large-scale, persistent peer-to-peer storage utility
SOSP '01 Proceedings of the eighteenth ACM symposium on Operating systems principles
Chord: a scalable peer-to-peer lookup protocol for internet applications
IEEE/ACM Transactions on Networking (TON)
GPFS: A Shared-Disk File System for Large Computing Clusters
FAST '02 Proceedings of the Conference on File and Storage Technologies
Pastry: Scalable, Decentralized Object Location, and Routing for Large-Scale Peer-to-Peer Systems
Middleware '01 Proceedings of the IFIP/ACM International Conference on Distributed Systems Platforms Heidelberg
SOSP '03 Proceedings of the nineteenth ACM symposium on Operating systems principles
Pangaea: a symbiotic wide-area file system
EW 10 Proceedings of the 10th workshop on ACM SIGOPS European workshop
DiCAS: An Efficient Distributed Caching Mechanism for P2P Systems
IEEE Transactions on Parallel and Distributed Systems
The Farsite project: a retrospective
ACM SIGOPS Operating Systems Review - Systems work at Microsoft Research
Beehive: O(1)lookup performance for power-law query distributions in peer-to-peer overlays
NSDI'04 Proceedings of the 1st conference on Symposium on Networked Systems Design and Implementation - Volume 1
Beehive: O(1)lookup performance for power-law query distributions in peer-to-peer overlays
NSDI'04 Proceedings of the 1st conference on Symposium on Networked Systems Design and Implementation - Volume 1
Geographical Characterization of YouTube: a Latin American View
LA-WEB '07 Proceedings of the 2007 Latin American Web Conference
Proceedings of the 2008 ACM SIGMOD international conference on Management of data
An extensible simulation tool for overlay networks and services
Proceedings of the 2009 ACM symposium on Applied Computing
Caching Strategy for Scalable Lookup of Personal Content
AP2PS '09 Proceedings of the 2009 First International Conference on Advances in P2P Systems
Object replication strategies in content distribution networks
Computer Communications
Proxy caching for media streaming over the Internet
IEEE Communications Magazine
Silo, rainbow, and caching token: schemes for scalable, fault tolerant stream caching
IEEE Journal on Selected Areas in Communications
Tapestry: a resilient global-scale overlay for service deployment
IEEE Journal on Selected Areas in Communications
Hi-index | 0.00 |
Today's trend to create and share personal content, such as digital photos and digital movies, results in an explosive growth of a user's personal content archive. Managing such an often distributed collection becomes a complex and time consuming task, indicating the need for a personal content management system that provides storage space transparently, is quality-aware, and is available at any time and at any place to end-users. A key feature of such a Personal Content Storage Service (PCSS) is the ability to search worldwide through the dataset of personal files. Due to the extremely large size of the dataset of personal content, a centralized solution is no longer feasible and an interesting approach for an efficient distributed PCSS implementation is to use a structured Peer-to-Peer network, and more in particular a Distributed Hash Table (DHT), providing a logarithmic lookup performance in the number of network nodes. In order to further increase the lookup performance, a caching layer is typically used between the application layer and the DHT. These caching strategies are location neutral, and usually do not exploit location dependence of request patterns. In this article we present our cooperative caching framework and introduce the cooperative Request Times Distance (RTD) caching algorithm. Since, lookup patterns in a PCSS typically have a power law popularity distribution and exhibit location dependent requests patterns, the proposed caching solution takes into account popularity and distance metrics. To enable cooperation between caches we introduce an update protocol, which only occasionally introduces one hop delay for a lookup operation. We present a systematic analysis of the caching framework and compare the cooperative caching algorithm to the state-of-the-art Beehive replication strategy. The cooperative RTD caching solution shows that when request patterns are more localized, the increase in lookup performance through cooperation is significantly better than Beehive.