통신비용을 최소화하는 복제 웹컨텐츠 분배나무 구성을 위한 개선된 알고리즘

Abstract

Recently, Tang and Chanson proposed a minimum cost distribution model for replicated Web contents subject to an expiration-based consistency management. Their model is a progress in that it can consider multiple replicas via the network of servers located on the Web. The proposed greedy heuristic, however, has an undesirable feature that the solution tends to converge a local optimum at an early stage of the algorithm. In this paper, we propose an algorithm based on a simple idea of preventing the early local convergence. The new algorithm provides solutions whose cost are, on the average, 27% lower than in the previous algorithm.