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
On the scale and performance of cooperative Web proxy caching
Proceedings of the seventeenth ACM symposium on Operating systems principles
Space/time trade-offs in hash coding with allowable errors
Communications of the ACM
On filter effects in web caching hierarchies
ACM Transactions on Internet Technology (TOIT)
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
Analysis and performance study for coordinated hierarchical cache placement strategies
Computer Communications
Towards a smart, self-scaling cooperative web cache
SOFSEM'12 Proceedings of the 38th international conference on Current Trends in Theory and Practice of Computer Science
| Hi-index | 0.00 |
In distributed web caching architectures, institutional proxies take advantage of their neighbors' contents in order to reduce the number of requests forwarded to the server. Intuitively, the maximum benefit from this cooperation is expected when the proxies that exhibit similar requests are grouped together. The current practice is to follow a static and manual configuration of neighbors. Such an approach has a number of drawbacks: (i) static allocation may not determine the best neighbors, especially if global knowledge of the participating proxies is not available, (ii) a manual allocation places significant administrative burden, (iii) static schemes are insensitive to changes in access patterns, and (iv) they cannot deal with the introduction of new, potentially useful, proxies. In this paper, we propose a set of algorithms that allow proxies to independently explore the network for better neighbors and continuously update their configuration in an adaptive fashion. The simulation experiments illustrate that dynamic neighbor reconfiguration leads to significantly higher hit ratios compared to the static approach. Although some researchers in the past have recognized the need for adaptive caching, to the best of our knowledge this is the first study to propose concrete algorithms and evaluate their efficacy.