Routing of multipoint connections
Broadband switching
A case for caching file objects inside internetworks
SIGCOMM '93 Conference proceedings on Communications architectures, protocols and applications
Internet Web servers: workload characterization and performance implications
IEEE/ACM Transactions on Networking (TON)
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
Computer Networks and ISDN Systems - Selected papers of the 3rd international caching workshop
Placement algorithms for hierarchical cooperative caching
Proceedings of the tenth annual ACM-SIAM symposium on Discrete algorithms
IEEE/ACM Transactions on Networking (TON)
Mobility management for hierarchical wireless networks
Mobile Networks and Applications
Analysis of web caching architectures: hierarchical and distributed caching
IEEE/ACM Transactions on Networking (TON)
Coordinated En-Route Web Caching
IEEE Transactions on Computers
Probabilistic methods for web caching
Performance Evaluation
Ensuring Latency Targets in Multiclass Web Servers
IEEE Transactions on Parallel and Distributed Systems
My Cache or Yours? Making Storage More Exclusive
ATEC '02 Proceedings of the General Track of the annual conference on USENIX Annual Technical Conference
On the Optimal Placement of Web Proxies in the Internet: The Linear Topology
HPN '98 Proceedings of the IFIP TC-6 Eigth International Conference on High Performance Networking
A New Document Placement Scheme for Cooperative Caching on the Internet
ICDCS '02 Proceedings of the 22 nd International Conference on Distributed Computing Systems (ICDCS'02)
Performance Evaluation of an Optimal Cache Replacement Policy for Wireless Data Dissemination
IEEE Transactions on Knowledge and Data Engineering
On Optimal Replication of Data Object at Hierarchical and Transparent Web Proxies
IEEE Transactions on Parallel and Distributed Systems
Optimal methods for coordinated enroute web caching for tree networks
ACM Transactions on Internet Technology (TOIT)
Supporting Cooperative Caching in Ad Hoc Networks
IEEE Transactions on Mobile Computing
Data storage placement in sensor networks
Proceedings of the 7th ACM international symposium on Mobile ad hoc networking and computing
Adaptive schemes for distributed web caching
Journal of Parallel and Distributed Computing
The LCD interconnection of LRU caches and its analysis
Performance Evaluation
A hierarchical internet object cache
ATEC '96 Proceedings of the 1996 annual conference on USENIX Annual Technical Conference
Benefit-Based Data Caching in Ad Hoc Networks
IEEE Transactions on Mobile Computing
COACS: A Cooperative and Adaptive Caching System for MANETs
IEEE Transactions on Mobile Computing
Data replication approaches for ad hoc wireless networks satisfying time constraints
International Journal of Parallel, Emergent and Distributed Systems
Ditto: a system for opportunistic caching in multi-hop wireless networks
Proceedings of the 14th ACM international conference on Mobile computing and networking
Energy saving strategies for cooperative cache replacement in mobile ad hoc networks
Pervasive and Mobile Computing
Dynamic cache reconfiguration strategies for cluster-based streaming proxy
Computer Communications
Traffic analysis of a Web proxy caching hierarchy
IEEE Network: The Magazine of Global Internetworking
A workload characterization study of the 1998 World Cup Web site
IEEE Network: The Magazine of Global Internetworking
Hi-index | 0.25 |
Data caching has been shown to be efficient in reducing network bandwidth consumption and accelerating information access. In a caching system, an important issue is coordinating data placement to achieve optimal system performance. This paper studies cache placement strategies and their performance in cooperative hierarchical caching environments. A theoretical model is introduced to analyze the access cost of placing a set of object copies in the routing path. Using this model, the object placement problem can be formulated as an optimization problem. It is proved that the problem can be divided into subproblems, thus optimal solutions can be obtained by using dynamic programming. It is further proved that if some nodes are known to be in the optimal solution, the calculation cost of the dynamic programming algorithms can be reduced. A heuristic greedy algorithm is also presented for efficient implementation. Performance of these strategies are evaluated using simulations under both synthetic workload traces and real workload traces. It is shown that both the optimal and the heuristic strategies perform well in cooperative hierarchical caching systems.