Skip to Main Content
We study approximate algorithms for document placement in distributed Web servers in this paper. With a set S of documents as input, we first give an approximate algorithm for document placement which serves as the fundamental concept of this paper in Section 3. This result improves the load and space bounds of Chen and Choi (2001). Based on this algorithm, we developed an algorithm under the case that S is sorted, and algorithms for partial document replication during the placement under both cases of sorted and unsorted S. Lastly, we propose an algorithm for dynamic placement at the cost of a factor O(logM) in the time-complexity, where M is number of servers.