Selected papers of the first conference on World-Wide Web
A caching relay for the World Wide Web
Selected papers of the first conference on World-Wide Web
Using name-based mappings to increase hit rates
IEEE/ACM Transactions on Networking (TON)
Analysis of Task Assignment Policies in Scalable Distributed Web-Server Systems
IEEE Transactions on Parallel and Distributed Systems
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
Not all hits are created equal: cooperative proxy caching over a wide-area network
Computer Networks and ISDN Systems - Selected papers of the 3rd international caching workshop
A survey of web caching schemes for the Internet
ACM SIGCOMM Computer Communication Review
IEEE Transactions on Knowledge and Data Engineering
Proxy Cache Algorithms: Design, Implementation, and Performance
IEEE Transactions on Knowledge and Data Engineering
Optimizing Static Job Scheduling in a Network of Heterogeneous Computers
ICPP '00 Proceedings of the Proceedings of the 2000 International Conference on Parallel Processing
Theory, Volume 1, Queueing Systems
Theory, Volume 1, Queueing Systems
Hash routing for collections of shared Web caches
IEEE Network: The Magazine of Global Internetworking
An implementation of the client-based distributed web caching system
APWeb'05 Proceedings of the 7th Asia-Pacific web conference on Web Technologies Research and Development
| Hi-index | 0.00 |
Abstract: Hash routing is an effective approach for coordinating a collection of web proxies. In this paper, we present a comprehensive analytical model for hash routing which takes into consideration a number of factors: original request distribution, object allocation strategy, speeds of the proxies and cache hit ratios. Based on this model, the optimal hash routing problems for static and dynamic client configurations are investigated. Two schemes, OBJ-OPT and OBJ/DNS-OPT, are proposed to reduce the response times of web requests. OBJ-OPT optimizes object allocation under static client configuration, and OBJ/DNS-OPT optimizes both object and DNS allocations under dynamic client configuration. Extensive trace-driven simulations have been conducted to evaluate the proposed schemes. The results show that they significantly outperform the intuitive scheme based only on the speeds of the proxies.