Hybrid cooperative schemes for scalable and stable performance of Web content delivery
Computer Networks: The International Journal of Computer and Telecommunications Networking
Cost-performance optimization of application- and context-aware distributed infrastructures
IEEE Transactions on Systems, Man, and Cybernetics, Part A: Systems and Humans
Bypassing proxy: a solution to overloaded web caching systems
ACOS'06 Proceedings of the 5th WSEAS international conference on Applied computer science
Anycast-based cooperative proxy caching
APWeb'05 Proceedings of the 7th Asia-Pacific web conference on Web Technologies Research and Development
| Hi-index | 0.07 |
Cooperating proxy caches are groups of HTTP proxy servers that organize to share cached objects. This paper develops analytical models for proxy cooperation which use speedup in user response time as the performance metric. Speedup expressions are derived for the cooperation upper bound, a proxy mesh, and a three-level proxy hierarchy. The equations compare fundamental design approaches by separating the proxy organization for object delivery from the mechanism for object discovery. Discovery mechanisms analyzed for the mesh and hierarchy models include ideal discovery, Internet cache protocol (ICP) query, and distributed metadata directories. Equations are evaluated using parameter estimates from experiments and from analysis of cache trace logs. Results indicate that proxy cooperation is marginally viable from the standpoint of average user response time, and that the miss penalty for the hierarchy renders it less viable than the mesh. Proxy cooperation can, however, reduce the variability in user response time and the number of long delays. A trace-driven simulation shows that caching constraints have little effect on cooperation performance due to request filtering by lower level caches.