SHERP

통신비용을 최소화하는 복제 웹컨텐츠 분배나무 구성을 위한 개선된 알고리즘
Improved Algorithms for Minimum Cost Replicated Web Contents Distribution Tree

Cited 0 time in webofscience Cited 0 time in scopus
Authors
홍성필; 이동권
Issue Date
2005
Publisher
한국경영과학회 = The Korean Operations Research and Management Science Society
Citation
경영과학, 제22권, 제2호(2005). pp. 99-107
Keywords
Consistency Management of Replicated Contents; Distribution Tree Configuration; Forest-growing Heuristics; Computational Experiment
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.
ISSN
1225-1100
Language
Korean
URI
http://uci.or.kr/G300-j12251100.v22n2p99
http://hdl.handle.net/10371/5340
Files in This Item:
Appears in Collections:
College of Engineering/Engineering Practice School (공과대학/대학원)Dept. of Industrial Engineering (산업공학과)Journal Papers (저널논문_산업공학과)
  • mendeley

Items in S-Space are protected by copyright, with all rights reserved, unless otherwise indicated.

Browse