The paper explores schemes for dynamic replication and migration of web objects in the context of an Internet hosting service. It describes a replica placement algorithm for deciding the location and number of replicas of an object as well as request distribution schemes for choosing among currently available replicas. We compare two classes of request distribution algorithms — namely feedback and non-feedback based. Further, we compare dynamic replication to a static replication scheme.

Many large web sites get more than 100 million hits everyday. They need a scalable web server system that can provide better performance to all the clients that may be in different geographical regions. Higher delays and losses are common on WAN links. To provide a better service to all the clients, it is natural to have fully replicated web server clusters in different geographical regions. In such an environment, one of the most important issues is that of server selection (and load balancing).

It includes basic libraries (API s) using which a lot of interfaces have to be implemented by the user according to the policy he is submitting. We will now identify each of these parts and their implementations one by one. It has however been modified for our aim and these modifications are included. The Original Test Bed Setup The burden balancing mechanisms have their comparative pros and cons and it is not simple to show the superiority of the one over another. To liken respective policies for Client Browsers HTTP Apache Tomcat Web Server Java Servlets App Logic JDBC MySQL Database Server Backend Original Test Bed Setup Web service to examine sheet interaction module. API for New Policies ask distribution at waiter position, an examination sheet was designed and implemented by Puneet et al. , which tries to emulate genuine web scenarios and implements an extremely configurable network waiter structure which can be configured to take a kind of burden balancing policies. All basic components used in the Internet are used in this tested, for instance, BIND (Berkeley Internet Domain Name Server) internet evolves and operates mostly without a key coordination, the deficiency of which was and is critically significant to the speedy increase and development of Internet. However, the deficiency of administration in twist makes it really hard to ensure appropriate operation and to trade consistently with operation problems. Meanwhile, the accessible web bandwidth and server capability remain to be overwhelmed by the skyrocketing Internet usage and the accelerating increase of bandwidth intense.

How documents of a Web spot are replicated and where they are placed among the server nodes have a substantial bearing on balance of load in a geographically Distributed Web Server (DWS) system. The traffic generated owed to movements of documents at runtime could overly affect the procedure of the DWS system. In this paper, we show that minimizing such traffic is NPhard. We indicate a new document distribution scheme that periodically performs sketchy replica of a spot’s documents at.

The weight of each server is proportional to its load capacity. Based on these constraints, we constructed an optimization problem whose objective function is to minimize the total communication costs needed to update the document distribution. This problem was proved to be NP complete. A replica placement that fulfills all the constraints is a feasible placement. However, because of constraint (3) an instance of this optimization problem does not necessarily have a feasible solution. Therefore, in practical document distribution, we relax the constraint (3)

Related Articles