Integer and combinatorial optimization
Integer and combinatorial optimization
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
Web caching with consistent hashing
WWW '99 Proceedings of the eighth international conference on World Wide Web
On the scale and performance of cooperative Web proxy caching
Proceedings of the seventeenth ACM symposium on Operating systems principles
IEEE/ACM Transactions on Networking (TON)
Analysis of web caching architectures: hierarchical and distributed caching
IEEE/ACM Transactions on Networking (TON)
AMnet 2.0: An Improved Architecture for Programmable Networks
IWAN '02 Proceedings of the IFIP-TC6 4th International Working Conference on Active Networks
Evaluating Cooperative Web Caching for Emerging Network Technologies
Innovative Anwendungen in Kommunikationsnetzen, 15. DFN-Arbeitstagung über Kommunikationsnetze
Service introduction in an active network
Service introduction in an active network
Active networks: Applications, security, safety, and architectures
IEEE Communications Surveys & Tutorials
Hash routing for collections of shared Web caches
IEEE Network: The Magazine of Global Internetworking
Designing cost-effective content distribution networks
Computers and Operations Research
| Hi-index | 0.24 |
Web caching is a widely used technique to decrease Internet traffic and server load, as well as to reduce client-perceived response times. Most currently deployed caches are almost isolated entities, with very limited cooperation between them. In this paper, we use the power of active networking to implement a much more fine-grained cooperation. Active networking allows to intercept and monitor passing request packets and to place, on demand, a cache at virtually every node in the network, giving a broad range of possible caching locations and offering considerable content placement opportunities. A scalable and fast heuristic is proposed for inter-cache cooperation. The performance of the heuristic is evaluated through simulations, implemented on a test network and shown to be optimal for tree topologies.