Skip Navigation

The Computer Journal 2001 44(5):329-339; doi:10.1093/comjnl/44.5.329
© 2001 by British Computer Society
This Article
Right arrow Full Text (PDF)
Right arrow Alert me when this article is cited
Right arrow Alert me if a correction is posted
Services
Right arrow Email this article to a friend
Right arrow Similar articles in this journal
Right arrow Similar articles in ISI Web of Science
Right arrow Alert me to new issues of the journal
Right arrow Add to My Personal Archive
Right arrow Download to citation manager
Right arrow Search for citing articles in:
ISI Web of Science (11)
Right arrowRequest Permissions
Google Scholar
Right arrow Articles by Jia, X.
Right arrow Articles by Du, D.
Right arrow Search for Related Content
Social Bookmarking
Add to CiteULike   Add to Connotea   Add to Del.icio.us  
What's this?

Optimal Placement of Web Proxies for Replicated Web Servers in the Internet

Xiaohua Jia1, Deying Li1, Xiaodong Hu1 and DingZhu Du2

1 Department of Computer Science, City University of Hong Kong, PRC Email: jia@cs.cityu.edu.hk 2 Department of Computer Science, University of Minnesota, Minneapolis, MN, USA Email: dzd@cs.umn.edu

This paper investigates the issues of the optimal placement of a limited number of Web proxies in an environment where a Web site is replicated (i.e. mirrored Web sites). Two different objectives are studied: minimizing the overall access cost by all clients to the Web site and minimizing the longest delay for any client to access the Web site. The problem is reduced to the placement of proxies in a set of trees whose root nodes are the server replicas. It is then formulated and solved by using a dynamic programming method. The significance of this work includes: (1) alleviating the Internet traffic of Web accesses; (2) improving the response time of Web page accesses; (3) maximizing Web server performance by using a limited number of proxies.

Received 17 April, 2001. Revised 4 July, 2001.


Add to CiteULike CiteULike   Add to Connotea Connotea   Add to Del.icio.us Del.icio.us    What's this?




Disclaimer:
Please note that abstracts for content published before 1996 were created through digital scanning and may therefore not exactly replicate the text of the original print issues. All efforts have been made to ensure accuracy, but the Publisher will not be held responsible for any remaining inaccuracies. If you require any further clarification, please contact our Customer Services Department.