On optimal replication of data object at hierarchical and transparent web proxies
Research output: Journal Publications and Reviews (RGC: 21, 22, 62) › 21_Publication in refereed journal › peer-review
Author(s)
Related Research Unit(s)
Detail(s)
| Original language | English |
|---|---|
| Pages (from-to) | 673-685 |
| Journal / Publication | IEEE Transactions on Parallel and Distributed Systems |
| Volume | 16 |
| Issue number | 8 |
| Publication status | Published - Aug 2005 |
Link(s)
Abstract
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). © 2005 IEEE.
Research Area(s)
- Data replication, Web caching, Web proxy, Web server, World Wide Web
Citation Format(s)
On optimal replication of data object at hierarchical and transparent web proxies. / Jia, Xiaohua; Li, Deying; Du, Hongwei et al.
In: IEEE Transactions on Parallel and Distributed Systems, Vol. 16, No. 8, 08.2005, p. 673-685.Research output: Journal Publications and Reviews (RGC: 21, 22, 62) › 21_Publication in refereed journal › peer-review
