Implementing global memory management in a workstation cluster
SOSP '95 Proceedings of the fifteenth ACM symposium on Operating systems principles
Removal policies in network caches for World-Wide Web documents
Conference proceedings on Applications, technologies, architectures, and protocols for computer communications
An adaptive data replication algorithm
ACM Transactions on Database Systems (TODS)
STOC '97 Proceedings of the twenty-ninth annual ACM symposium on Theory of computing
Page replacement with multi-size pages and applications to Web caching
STOC '97 Proceedings of the twenty-ninth annual ACM symposium on Theory of computing
Summary cache: a scalable wide-area Web cache sharing protocol
Proceedings of the ACM SIGCOMM '98 conference on Applications, technologies, architectures, and protocols for computer communication
Performance study of a collaborative method for hierarchical caching in proxy servers
WWW7 Proceedings of the seventh international conference on World Wide Web 7
Proceedings of the ninth annual ACM-SIAM symposium on Discrete algorithms
Placement algorithms for hierarchical cooperative caching
Proceedings of the tenth annual ACM-SIAM symposium on Discrete algorithms
On the scale and performance of cooperative Web proxy caching
Proceedings of the seventeenth ACM symposium on Operating systems principles
Replication Algorithms in a Remote Caching Architecture
IEEE Transactions on Parallel and Distributed Systems
The case for geographical push-caching
HOTOS '95 Proceedings of the Fifth Workshop on Hot Topics in Operating Systems (HotOS-V)
Reduce, Reuse, Recycle: An Approach to Building Large Internet Caches
HOTOS '97 Proceedings of the 6th Workshop on Hot Topics in Operating Systems (HotOS-VI)
WebWave: Globally Load Balanced Fully Distributed Caching of Hot Published Documents
ICDCS '97 Proceedings of the 17th International Conference on Distributed Computing Systems (ICDCS '97)
Fast fault-tolerant concurrent access to shared objects
FOCS '96 Proceedings of the 37th Annual Symposium on Foundations of Computer Science
Design Considerations for Distributed Caching on the Internet
ICDCS '99 Proceedings of the 19th IEEE International Conference on Distributed Computing Systems
Cost-aware WWW proxy caching algorithms
USITS'97 Proceedings of the USENIX Symposium on Internet Technologies and Systems on USENIX Symposium on Internet Technologies and Systems
A hierarchical internet object cache
ATEC '96 Proceedings of the 1996 annual conference on USENIX Annual Technical Conference
An Expiration Age-Based Document Placement Scheme for Cooperative Web Caching
IEEE Transactions on Knowledge and Data Engineering
Subscription-enhanced content delivery
Web content caching and distribution
Coordinated enroute multimedia object caching in transcoding proxies for tree networks
ACM Transactions on Multimedia Computing, Communications, and Applications (TOMCCAP)
Optimal methods for coordinated enroute web caching for tree networks
ACM Transactions on Internet Technology (TOIT)
The LCD interconnection of LRU caches and its analysis
Performance Evaluation
An optimal solution for caching multimedia objects in transcoding proxies
Computer Communications
Mistreatment-resilient distributed caching
Computer Networks: The International Journal of Computer and Telecommunications Networking
Optimal Replica Placement under TTL-Based Consistency
IEEE Transactions on Parallel and Distributed Systems
Energy saving strategies for cooperative cache replacement in mobile ad hoc networks
Pervasive and Mobile Computing
An object placement advisor for DB2 using solid state storage
Proceedings of the VLDB Endowment
Collaborative cache based on path scores
WISE'07 Proceedings of the 8th international conference on Web information systems engineering
Coordinated multimedia object replacement in transcoding proxies
The Journal of Supercomputing
Contention-aware data caching in wireless multi-hop ad hoc networks
Journal of Parallel and Distributed Computing
Cooperative determination on cache replacement candidates for transcoding proxy caching
GCC'05 Proceedings of the 4th international conference on Grid and Cooperative Computing
Cooperative determination on cache replacement candidates for transcoding proxy caching
ICCNMC'05 Proceedings of the Third international conference on Networking and Mobile Computing
Computer Networks: The International Journal of Computer and Telecommunications Networking
Cache me if you can: capacitated selfish replication games
LATIN'12 Proceedings of the 10th Latin American international conference on Theoretical Informatics
Collaborative forwarding and caching in content centric networks
IFIP'12 Proceedings of the 11th international IFIP TC 6 conference on Networking - Volume Part I
Caching in information centric networking: A survey
Computer Networks: The International Journal of Computer and Telecommunications Networking
| Hi-index | 0.00 |
In a large-scale information system such as a digital library or the web, a set of distributed caches can improve their effectiveness by coordinating their data placement decisions. Using simulation, we examine three practical cooperative placement algorithms, including one that is provably close to optimal, and we compare these algorithms to the optimal placement algorithm and several cooperative and noncooperative replacement algorithms. We draw five conclusions from these experiments: 1) Cooperative placement can significantly improve performance compared to local replacement algorithms, particularly when the size of individual caches is limited compared to the universe of objects; 2) although the amortizing placement algorithm is only guaranteed to be within 14 times the optimal, in practice it seems to provide an excellent approximation of the optimal; 3) in a cooperative caching scenario, the recent greedy-dual local replacement algorithm performs much better than the other local replacement algorithms; 4) our hierarchical-greedy-dual replacement algorithm yields further improvements over the greedy-dual algorithm especially when there are idle caches in the system; and 5) a key challenge to coordinated placement algorithms is generating good predictions of access patterns based on past accesses.