Placement algorithm of web server replicas

Abstract

Recently, contents distribution technologies have been used to cope with the explosive dem and for Web services. In this paper, we addressed the issue of the optimal placement of replicas in the environment where Web contents are replicated. We placed replicas so that clients can have access to replicas with the proper delay and bandwidth. We attempted to solve the problem via dynamic programming considering cost of delay and traffic. We have come up with O((n-dh).|chvi|) time complexity that is less than O(n2). We defined the threshold and proved that our algorithm guarantees the reliable services. © Springer-Verlag 2004.