By Topic

Approximate algorithms for document placement in distributed Web servers

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

The purchase and pricing options are temporarily unavailable. Please try again later.
1 Author(s)
Tse, S.S.H. ; Dept. of Comput., Hong Kong Polytech. Univ., Kowloon, China

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.

Published in:

Parallel Architectures, Algorithms and Networks, 2004. Proceedings. 7th International Symposium on

Date of Conference:

10-12 May 2004