The Community for Technology Leaders
Proceedings 21st International Conference on Distributed Computing Systems (2001)
Mesa, AZ
Apr. 16, 2001 to Apr. 19, 2001
ISBN: 0-7695-1077-9
pp: 0191
Xueyan Tang , Hong Kong University of Science and Technology
Samuel T. Chanson , Hong Kong University of Science and Technology
ABSTRACT
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.
INDEX TERMS
CITATION

X. Tang and S. T. Chanson, "Optimal Hash Routing for Web Proxies," Proceedings 21st International Conference on Distributed Computing Systems(ICDCS), Mesa, AZ, 2001, pp. 0191.
doi:10.1109/ICDSC.2001.918948
83 ms
(Ver 3.3 (11022016))