Abstract
This paper investigates the problem of optimally replicating objects at the candidate proxies in content distribution network. In our model, each proxy in the set of candidates has a finite storage capacity for replicating objects and charges fee for use. The optimization problem is to find a set of proxies from candidates set for replicating objects at them such that the total access cost is minimized, subject to the constraints that the objects placed at a proxy should not exceed the storage capacity of the proxy and the total fees charged by the proxies should not exceed a pre-specified budget. We formulate this problem as a combinational optimization problem and show that this optimization problem is NP complete. We propose two heuristics and evaluate them by simulation. The simulation results show that these two heuristics could significantly reduce the access cost.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
B. Li, M. J. Golin, G.F. Italiano, X. deng and K. Sohraby: “On The Optimal Placememnt of Web Proxies in The Internet”, Proc. IEEE INFOCOM 1999, vol. 3, March 1999, pp. 1282–1290.
X.H. Jia, D.Y. Li, X.D. Hu, D.Z. Du: “Optimal Placement of Web Proxies for Replicated Web Servers in then Internet”, The Computer Journal, Vol. 44, No. 5, Oct. 2001, pp. 329–339.
Q. Lili, V. N. Padmanabhan, and G. M. Voelker: “On the placement of Web server replicas” Proc. IEEE INFOCOM 2001, vol. 3, 2001, pp. 1587–1596.
X.H. Jia, D.Y. Li, X.D. Hu, D.Z. Du: “Placement of read-write Web proxies on the Internet”, Proc. of IEEE 21st International Conference on Distributed Computing Systems, 2001. pp. 687–690.
O. Wolfson, and A. Milo: “The Multicast Policy and Its Relationship to Replicated Data Placement”, ACM Transaction on Database Systems, Vol. 16, No. 1, 1991, pp. 181–205.
K. Kalpakis, K. Dasgupta, O. Wolfson: “Optimal placement of replicas in trees with read, write, and storage costs”, IEEE Transactions on Parallel and Distributed Systems, Vol. 12, No. 6, June 2001, pp. 628–637.
X.H. Jia, D.Y. Li, D.Z. Du: “Data Replication in En-Route Web Proxies”, submitted to IEEE Intern. Conf. On Distributed Computing Systems, USA, May, 2003.
J. Kangasharju, J. Roberts, and K.W. Ross: “Object Replication Strategies in Content Distribution Networks”, Computer Communications, Vol. 25, 2002, pp. 376–383.
J.L. Xu; B. Li; D.L. Lee: “Placement problems for transparent data replication proxy services”, IEEE Journal on Selected Areas in Communications, Vol. 20, No. 7, Sept. 2002, pp. 1383–1398.
T. Loukopoulos, I. Ahmad: “Static and adaptive data replication algorithms for fast information access in large distributed systems”, Proc. of 20th International Conference on Distributed Computing Systems, 2000, pp. 385–392.
T. Loukopoulos, I. Ahmad, D. Papadias: “An overview of data replication on the Internet”, Proc. of International Symposium on Parallel Architectures, Algorithms and Networks, 2002, pp. 31–36.
H. Stockinger, A. Samar, B. Allcock, I. Foster, K. Holtman, and B. Tierney: “File and object replication in data grids”, Proc. of 10th IEEE International Symposium on High Performance Distributed Computing, 2001. pp. 76–86.
I. Cidon, S. Kutten, R. Soffer: “Optimal Allocation of Electronic Content”, Proc. IEEE INFOCOM 2001, vol. 3, 2001, pp. 1773–1780.
E. Cronin, S. Jamin, C. Jin. A.R. Kurc, D. Raz, and Y. Shavitt: “Constrained Mirror Placement on the Internet”, IEEE Journal on Selected Areas in Communications, Vol. 20, No. 7, Sept. 2002.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2003 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Zhang, X., Wang, W., Tan, X., Zhu, Y. (2003). Data Replication at Web Proxies in Content Distribution Network. In: Zhou, X., Orlowska, M.E., Zhang, Y. (eds) Web Technologies and Applications. APWeb 2003. Lecture Notes in Computer Science, vol 2642. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-36901-5_56
Download citation
DOI: https://doi.org/10.1007/3-540-36901-5_56
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-02354-8
Online ISBN: 978-3-540-36901-1
eBook Packages: Springer Book Archive