计算机科学与探索2016，Vol.10Issue(11)：1634-1641,8.DOI:10.3778/j.issn.1673-9418.1507048
副本放置中的更新策略及算法
Replica Update Strategy and Algorithms for Replica Placement
摘要
Abstract
Replica technology is widely applied in cloud computing and distributed systems, the reasonable data replica placement is an important means to reduce the operation cost of network, and is also the key issue of replica technology. Replica update is that the replicas are added and deleted when data access requirements dynamically change. Based on multiple policy, this paper proposes a dynamic updating algorithm named MPFSF (min_placement far servers first) to solve the update problem. According to the need to implement the necessary replica update, this paper reuses as much as possible the pre-existing replicas and maximizes the capacity of each replica to reduce the date access latency and improve the efficiency of data access, by adding the constraint of communication distance. The experimental results show that, for the proposed algorithm with update policy, the running cost of the network gets a considerable reduction under the different distance limits, and the best improvement is up to 84.6%in comparison to the state-of-the-art.关键词
树形网络/副本放置/多访问策略/更新Key words
tree network/replica placement/multiple policy/update分类
信息技术与安全科学引用本文复制引用
李帅,党鑫,王旭,武继刚..副本放置中的更新策略及算法[J].计算机科学与探索,2016,10(11):1634-1641,8.基金项目
The National Natural Science Foundation of China under Grant No.61403276(国家自然科学基金) （国家自然科学基金）
the Specialized Research Fund for the Doctoral Program of Higher Education of China under Grant No.20131201110002(高等学校博士学科点专项科研基金) （高等学校博士学科点专项科研基金）
