Optimal hash routing for Web proxies

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: the original request distribution, the object allocation strategy, the 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 (OBJect OPTimization) and OBJ/DNS-OPT (OBJect and Domain Name Server OPTimization), are proposed to reduce the response times of Web requests. OBJ-OPT optimizes object allocation under a static client configuration, and OBJ/DNS-OPT optimizes both object and DNS allocations under a 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