This paper investigates the issues of the optimal placement of a limited nu
mber of Web proxies in an environment where a Web site is replicated (i.e.
mirrored Web sites). Two different objectives are studied: minimizing the o
verall access cost by all clients to the Web site and minimizing the longes
t delay for any client to access the Web site. The problem is reduced to th
e placement of proxies in a set of trees whose root nodes are the server re
plicas. It is then formulated and solved by using a dynamic programming met
hod. The significance of this work includes: (1) alleviating the Internet t
raffic of Web accesses; (2) improving the response time of Web page accesse
s; (3) maximizing Web server performance by using a limited number of proxi
es.