By Topic

Optimal and near optimal web proxy placement algorithms for networks with planar graph topologies

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)
Taha, A.-E.M. ; Dept. of Electr. & Comput. Eng., Queen''s Univ., Canada ; Kamal, A.E.

This paper investigates the placement of a finite set of web cache proxies in a computer network with a planar graph topology, based on a dynamic programming approach. Three criteria are defined for the web proxy placement: 1) the min-sum strategy with consolidated request forwarding (MS-CRF); 2) the min-sum criterion with immediate request forwarding (MS-IRF); and 3) the minmax with immediate request forwarding (MM-IRF). Optimal placement is obtained under MS-CRF. Under the MS-IRF and MM-IRF, a near optimal placement is achieved. This can be improved through a refinement strategy. The paper deals with the cylindrical mesh topology as a general topology on which any planar graph can be embedded.

Published in:

Distributed Computing Systems Workshops, 2003. Proceedings. 23rd International Conference on

Date of Conference:

19-22 May 2003