By Topic

Optimal placement of mirrored web servers in ring 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 $31
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

4 Author(s)
Liu, H. ; Dept. of Comput. Sci., City Univ. of Hong Kong, Kowloon, China ; Jia, X. ; Li, D. ; Lee, C.H.

The placement problem of mirrored web servers in ring networks is investigated in the case where each client accesses the closest mirrored server. Without budget constraint, it is shown that the mirrored servers in the optimal placement are in the shape of a string including the original server S, and an efficient algorithm is proposed that computes the optimal placement with time complexity O(|C|2×|V|). With budget constraint, if all candidate servers charge the same fee, an algorithm is proposed to compute the optimal placement in time O(k2|C|3|V|) by using dynamic programming. If candidates charge different fees, the problem is shown to be NP-hard, and two heuristic algorithms are proposed. The performance of the proposed placement schemes is evaluated with the traffic-reduction ratio and the budget-usage ratio over a wide range of system parameters.

Published in:

Communications, IEE Proceedings-  (Volume:151 ,  Issue: 2 )