Utility of co-operating Web proxy caches
WWW7 Proceedings of the seventh international conference on World Wide Web 7
Summary of WWW characterizations
WWW7 Proceedings of the seventh international conference on World Wide Web 7
Summary cache: a scalable wide-area web cache sharing protocol
IEEE/ACM Transactions on Networking (TON)
IEEE Transactions on Knowledge and Data Engineering
A Proxy-Based Approach for Dynamic Content Acceleration on the WWW
WECWIS '02 Proceedings of the Fourth IEEE International Workshop on Advanced Issues of E-Commerce and Web-Based Information Systems (WECWIS'02)
Characterizing Response Time of WWW Caching Proxy Servers
WWC '98 Proceedings of the Workload Characterization: Methodology and Case Studies
Taxonomy and Design Analysis for Distributed Web Caching
HICSS '99 Proceedings of the Thirty-second Annual Hawaii International Conference on System Sciences-Volume 8 - Volume 8
Least Popularity-per-Byte Replacement Algorithm for a Proxy Cache
ICPADS '01 Proceedings of the Eighth International Conference on Parallel and Distributed Systems
A Study on the Content Distribution of Cooperative Proxy Caching Using Total Cost-Aware Scheme
ICCNMC '03 Proceedings of the 2003 International Conference on Computer Networks and Mobile Computing
A hierarchical internet object cache
ATEC '96 Proceedings of the 1996 annual conference on USENIX Annual Technical Conference
IEEE Communications Magazine
Limitations and benefits of cooperative proxy caching
IEEE Journal on Selected Areas in Communications
Placement problems for transparent data replication proxy services
IEEE Journal on Selected Areas in Communications
| Hi-index | 0.00 |
As one of the most popular applications currently running on the Internet, the World Wide Web is of an exponential growth in size, which results in the network congestion and server overloading. Web caching as an important technique aims at reducing network traffic, server load, and user-perceived retrieval delays by replicating popular contents on proxy caches. In our paper, we develop an anycast-based cooperative web proxy caching mechanism. It puts response time, hop counts, self-organized load balancing, adaption, and self-configuration as primary concerns. In our scheme, anycast is used to bring a server “nearest” to a client to improve overall performance, all proxies in a local network consists an anycast group. The object placement and replacement problems are formulated as an optimization problem and the solution is obtained by using an anycast-based cooperative proxy caching algorithm. Some simulation experiments have been conduced to evaluate the proposed scheme in terms of a wide range of performance metrics. Analytical and experimental results show that our algorithm outperforms some existing algorithms in response time, hop counts.