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.

Full Text
Published version (Free)

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call