By Topic

Optimal placement of Web proxies for tree networks

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.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
Keqiu Li ; Graduate Sch. of Inf. Sci., Japan Adv. Inst. of Sci. & Technol., Ishikawa, Japan ; Hong Shen

Placement of Web proxy servers is an important avenue to save network bandwidth, alleviate server load, and reduce latency experienced by users. The general problem of Web proxy placement is to compute the optimal locations for placing k Web proxies in a network such that the objective concerned is minimized or maximized. We address this problem for tree networks and propose a novel mathematical model for it. In our model, we consider maximizing the overall access gain as our objective and formulate this problem as an optimization problem. The optimal placement is obtained using a computationally efficient dynamic programming-based algorithm. Applying our mathematical model, we also present a solution to Web proxy placement for autonomous systems (ASes), as a natural extension of the solution for tree networks. Our algorithms have been implemented. The simulation results show that our model significantly outperforms the random placement model.

Published in:

e-Technology, e-Commerce and e-Service, 2004. EEE '04. 2004 IEEE International Conference on

Date of Conference:

28-31 March 2004