期刊文献+

云存储系统中基于动态规划的最小开销数据副本布局研究 被引量:5

Research on Minimum Cost Data Replica Distribution Based on Dynamic Planning in Cloud Storage System
下载PDF
导出
摘要 传统的副本布局策略较少考虑数据传输开销,且对网络结构有所限定,导致通用性不足。为此,基于动态规划方法,以最小化数据管理开销为目标,提出一种云存储系统中最小开销数据副本布局策略。在数据管理综合开销模型的基础上,比较数据中心放置与不放置副本2种情况下的开销,从而确定副本位置。实验结果表明,该策略能够实现副本的合理分布,在有效降低数据管理开销的同时,可减少平均响应时间与网络传输量,提升云存储系统性能。 Traditional replicas distribution strategies consider less data transmission cost and constrainsd network structure lack of universality,a minimum cost of replicas distribution strategy using dynamic planning technology is put up to minimize the overhead of data management in the cloud storage system. It presents a comprehensive data management model including data storage,transmission and the update cost,compares their values and chooses the one with lower cost for replica placement. Experimental results showthat the strategy can realize reasonable distribution of replica from global minimum cost view,which can reduce the overall data management cost,and effectively reduce the network transmission and the average response time,and therefore promote the development of cloud storage system.
作者 吴修国
出处 《计算机工程》 CAS CSCD 北大核心 2017年第7期29-37,共9页 Computer Engineering
基金 国家自然科学基金(61571272) 山东省泰山学者工程专项经费 山东省自然科学基金(ZR2016FM01) 济南市高校自主创新计划项目(201303015)
关键词 云存储系统 副本管理 最小开销 动态规划 副本布局 cloud storage system replica management minimum cost dynamic planning replica distribution
  • 相关文献

参考文献9

二级参考文献91

  • 1李红莲,王春花,袁保宗,朱占辉.针对大规模训练集的支持向量机的学习策略[J].计算机学报,2004,27(5):715-719. 被引量:53
  • 2陈粤,边泽强,孟晓风.基于信号参数集最小距离的并行测试任务调度算法[J].系统仿真学报,2006,18(9):2409-2411. 被引量:17
  • 3侯孟书,王晓斌,卢显良,任立勇.一种新的动态副本管理机制[J].计算机科学,2006,33(9):50-51. 被引量:13
  • 4李静,陈蜀宇,吴长泽.一种基于安全的网格数据副本策略模型[J].计算机应用,2006,26(10):2282-2284. 被引量:2
  • 5Lv Q, Cao P, Cohen E et al. Search and replication in un- structured Peer to-Peer networks//Proceedings of the Inter-national Conference on Supercomputing. New York City, 2002:84-95.
  • 6Goel S, Buyya R. Data replication strategies in wide area dis-tributed systems//Qiu Robin G. Enterprise Service Compu- ting: From Concept to Deployment. Hershey, PA, USA: Idea Group Publishing, 2006:211-241.
  • 7Feng G, Jiang Y, Chen Get ai. Replication strategy in un- structured Peer to-Peer systems//Proceedlngs of the [nterna-tional Parallel and Distributed Processing Symposium. Long Beach, CA, USA, 2007:1-8.
  • 8Baev I D, Rajaraman R. Approximation algorithms for dataplacement in arbitrary networks//Proceedings of the Sympo- sium on Discrete Algorithms. Washington, D. C. , USA, 2001:661-670.
  • 9Chekuri C, Kumar A. Maximum coverage problem withgroup budget constraints and applications//Proceedings of the International Workshop on Approximation Algorithmsfor Combinatorial Optimization Problems. Cambridge, MA, USA, 2004:72-83.
  • 10Shmoys D B, Swamy C, Levi R. Facility location with serv- ice installation costs//Proceedings of the Symposium on Dis-crete Algorithms. New Orleans, Louisiana, USA, 2004, 1088-1097.

共引文献321

同被引文献62

引证文献5

二级引证文献7

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

内容加载中请稍等...
;
使用帮助 返回顶部