An Data Replication and Deletion Algorithm for Web Objects

Abstract:

The phenomenal growth of the object has brought huge increase in the traffic on World Wide Web. Long read latency of service experienced by the end-users, especially during the peak hours, continues to be the common problem to the popular web servers while retrieving popular objects. A replication and deletion algorithm is presented to solve object replication problem, which is a NP-hard problem and can be formulated as a 0-1 constraint optimization problem. The algorithm defines an appropriate replica distribution with the objective to decrease the number of object access operations over excessive distances, balance the load of popular web servers, and then minimize the network traffic of the object. Object deletion in a distributed web-server environment is one of the possible solutions to extend available memory and reduce the load of the server. During the adaptive time period due to different object update frequency, objects are dynamically duplicated and deleted in a distributed web server system with limited storage capacity. Simulation results demonstrate the performance of the proposed algorithm.

• Periodical: Advanced Materials Research (Volumes 798-799)
• Pages: 794-797
• DOI: https://doi.org/10.4028/www.scientific.net/AMR.798-799.794
• Online since: September 2013
• Authors: Yan Kang, Zhong Min Wang, Yi Fan Zhang, Ying Lin
• Keywords: Adaptive Method, Data Mining (DM), Data Replication, Internet, World Wide Web

References

[1] Dj.M. Maric, P.F. Meier and S.K. Estreicher: Mater. Sci. Forum Vol. 83-87 (1992), p.119.

[1] M.F. Arlitt, C.L. Williamson, Internet web sites: workload characterization and performance implications, IEEE Trans. Network. Vol. 5 (5) (1997), p.631–64.

DOI: 10.1109/90.649565

[2] F. B Schneider, Implementing fault-tolerant services using the state machine approach: a tutorial, ACM Comput. Surv Vol. 22 (4) (1990), p.299–319.

DOI: 10.1145/98163.98167

[3] M. Baentsh et al., Enhancing the web's infrastructure: from caching to replication, IEEE Internet Comput. Vol. 15(1997), p.18–27.

[4] A. Bestavros, Demand-based document dissemination to reduce traffic and balance load in distributed information systems, in: Proc. IEEE Symp. on Parallel and Distributed Processing, (1995), p.338–345.

DOI: 10.1109/spdp.1995.530703

[5] V. Cardellini, M. Colajanni, P.S. Yu, Redirection algorithms for load sharing in distributed web-site systems, in: Proc. IEEE 19th Int. Conf. Distributed Computing Systems, Austin, TX, 1999, p.528–535.

DOI: 10.1109/icdcs.1999.776555

[6] F. Tenzakhti, K. Day, and M. Olud-Khaoua, Replication algorithms for the world-wide web. Journal of System Architecture, Vol. 50 (2004), p.591–605.

DOI: 10.1016/j.sysarc.2003.12.003

[7] O. Wolfson, S. Jajodia, and Y. Huang, An adaptive data replication algorithm. ACM Transaction on Database Systems, Vol. 22(2) (1997) p.255–314.

DOI: 10.1145/249978.249982

[8] A. Bestavros, Demand-based document dissemination to reduce traffic and balance load in distributed information systems. In Proceedings of IEEE symposium on parallel and distributed processing (1995). p.338–345.

DOI: 10.1109/spdp.1995.530703

[9] F. Tenzakhti, K. Day, and M. Olud-Khaoua. Replication algorithms for the world-wide web. Journal of System Architecture, Vol. 50 (2004), p.591–605.

DOI: 10.1016/j.sysarc.2003.12.003

[10] L. Thanasis, A Ishfaq, Static and adaptive distributed data replication using genetic algorithms. J. Parallel Distrib. Comput. Vol 64(2004). pp.270-1285.

[11] Mahmood A. Replicating web contents using a hybrid particle swarm optimization. Information Processing and Management, Vol. 46(2010), pp.170-179.

DOI: 10.1016/j.ipm.2009.06.006