Generating representative Web workloads for network and server performance evaluation
SIGMETRICS '98/PERFORMANCE '98 Proceedings of the 1998 ACM SIGMETRICS joint international conference on Measurement and modeling of computer systems
Web caching with consistent hashing
WWW '99 Proceedings of the eighth international conference on World Wide Web
An Automatic Cache Cooperative Environment Using ICP
ITCC '02 Proceedings of the International Conference on Information Technology: Coding and Computing
Proxy Caching with Hash Functions
Proxy Caching with Hash Functions
ProxyTeller: A Proxy Placement Tool for Content Delivery under Performance Constraints
WISE '03 Proceedings of the Fourth International Conference on Web Information Systems Engineering
Extended Consistent Hashing: An Efficient Framework for Object Location
ICDCS '04 Proceedings of the 24th International Conference on Distributed Computing Systems (ICDCS'04)
Efficiently serving dynamic data at highly accessed web sites
IEEE/ACM Transactions on Networking (TON)
Cache Clouds: Cooperative Caching of Dynamic Documents in Edge Networks
ICDCS '05 Proceedings of the 25th IEEE International Conference on Distributed Computing Systems
Supporting Cooperative Caching in Ad Hoc Networks
IEEE Transactions on Mobile Computing
Efficient web content delivery using proxy caching techniques
IEEE Transactions on Systems, Man, and Cybernetics, Part C: Applications and Reviews
IEEE Communications Magazine
Hi-index | 0.00 |
Caching web pages is an important part of web infrastructure. The effects of caching services are even more pronounced for wireless infrastructures due to their limited bandwidth. Medium to large-scale infrastructures deploy a cluster of servers to solve the scalability problem and hot spot problem inherent in caching. In this report, we present Dynamic Information-based Scalable Hashing (DISH) that evenly hashes client requests to a cluster of cache servers. Three types of runtime information are used to determine when and how to cache pages, including cache utilization, CPU usage, and number of connections. Pages cached are stored and retrieved mutually exclusively to/from all the servers. We have implemented our approach and performed various experiments using publicly available traces. Experimental results on a cluster of 16 cache servers demonstrate that the proposed hashing method gives 45% to 114% performance improvement over other widely used methods, while addressing the hot spot problem.