The Community for Technology Leaders
RSS Icon
Subscribe
Issue No.08 - August (2005 vol.16)
pp: 673-685
ABSTRACT
<p><b>Abstract</b>—This paper investigates the optimal replication of data objects at hierarchical and transparent web proxies. By transparent, we mean the proxies are capable of intercepting users' requests and forwarding the requests to a higher level proxy if the requested data are not present in their local cache. Two cases of data replication at proxies are studied: 1) proxies having unlimited storage capacities and 2) proxies having limited storage capacities. For the former case, an efficient algorithm for computing the optimal result is proposed. For the latter case, we prove the problem is NP-hard, and propose two heuristic algorithms. Extensive simulations have been conducted and the simulation results have demonstrated significant performance gain by using the proposed data replication algorithms and also shown the proposed algorithms out-perform the standard web caching algorithm (LRU threshold method).</p>
INDEX TERMS
Web server, Web proxy, Web caching, data replication, World Wide Web.
CITATION
Deying Li, Xiaohua Jia, Jinli Cao, "On Optimal Replication of Data Object at Hierarchical and Transparent Web Proxies", IEEE Transactions on Parallel & Distributed Systems, vol.16, no. 8, pp. 673-685, August 2005, doi:10.1109/TPDS.2005.94
34 ms
(Ver 2.0)

Marketing Automation Platform Marketing Automation Tool