期刊文献+

一种分布式编码算法在云存储中的应用

The Application of a Distributed Coding Arithmetic in Cloud Storage
下载PDF
导出
摘要 在云存储中为保证数据的完整可靠,必须采用冗余备份的方式存储数据.为了更好的发挥存储节点的作用,在分析现有的冗余方式基础上提出了一种分布式编码算法.在新的冗余方案中编解码操作在各存储节点并行完成,而不需要将整个数据文件集中进行编解码,充分发挥了分布式系统优势.通过实验仿真验证了方法的可行性,大大提高了数据存储速率,提高了数据可用性,改善了系统性能. The method of redundancy was general be used to ensure the integrity and availability of data in cloud storage. This paper introduced a distributed coding arithmetic after analyzing those method existing. In the new arithmetic, the operation of coding and decoding was doing in the storage nodes, avoiding coding and decoding for the whole data file simultaneous. Through making full advantage of distributed system, the velocity of data storage was heighten consumedly, the availability of data was also improved, the performance of the storage system was enhanced.
出处 《微电子学与计算机》 CSCD 北大核心 2014年第2期77-79,84,共4页 Microelectronics & Computer
基金 国家"八六三"资助项目(2011701AA0213)
关键词 云存储 数据冗余 分布式编码 纠删码 cloud storage data redundancy distributed coding erasure code
  • 相关文献

参考文献7

  • 1Ghemawat S, Gobioff H. The google file system[C] //Proceedings of the 19th ACM Symposium on Oper- ating Systems Principles. New York: ACM Press, 2003: 19-22.
  • 2Hvachko K, Kuang H, Radia S. The hadoop distribu- ted filesystem[C]// IEEE 26th Symposium on Storage Systems and Technology. Piscataway, NJ: IEEE Press, 2010 : 1-10.
  • 3余林琛,章巍,林强,许杰星,钟贝.RS纠删码在云存储中的应用[J].微电子学与计算机,2011,28(8):234-236. 被引量:7
  • 4Plank J S, Xu L. Optimizing cauchy reod-solomon codes for fault-tolerant network storage applications[C] //Pro of the 5th IEEE Intemational Synsium on Netvrk Compu- ting and Applications. Cambridge, MA, 2006: 38-46.
  • 5王意洁,卢锡城.基于Tornado码的复制算法[J].国防科技大学学报,2004,26(3):39-42. 被引量:4
  • 6周游,刘鹏,杨盛祥,薛志强,文艾.基于私有云的数据冗余技术研究[J].电脑知识与技术,2011,7(1):16-19. 被引量:6
  • 7慕建君,路成业,王新梅.关于纠删码的研究与进展[J].电子与信息学报,2002,24(9):1276-1281. 被引量:15

二级参考文献34

  • 1Kubiatowicz J, Bindel D, Chen Y, Czerwinski S, et al. OceanStore: An Architecture lor Global-scale Persistent Storage[C]. Proc. Conf. Architectural Support for Programming Languages and Operating Systems (ASPLOS-IX), ACM Press, New York, 2000:190 - 201.
  • 2Stoica I, Morris M, Karger D, Kaashoek M F.Chord: A Scalable Peer-to-peer Lookup Service for Intemet Applications[ C]. ACM SIGCOMM 2001,San Deigo, CA, 2001:160 - 177.
  • 3Druschel P, Rowstron A. PAST: A Large-scale,Persistent Peer-to-peer Storage Utility[C]. In: Proc of HotOS Ⅷ, Schloss Elmau, Germany, 2001:75 - 80.
  • 4Cohen E, Shenker S. Replication Strategies in Unstructured Peer-to-peer Networks[C]. In the ACM SIGCOMM'02 Conference, Pittsburgh, USA,August 2002:308 - 321.
  • 5Kangasharju J, Roberts J, Ross K W. Object Replication Strategies in Content DistributionNetworks[C], In Proceedings of WCW'01: Web Caching and Content Distribution Workshop, Boston, USA, June 2001:252 - 201.
  • 6Plaxton C G, Rajaraman R, Richa A W. Accessing Nearby Copies of Replicated Objects in a Distributed Environment[ C]. In Proc. 9th Annual ACM Symposium on Parallel Algorithms and Architectures (SPAA'97), Newport, RI, USA, 1997:311-320.
  • 7Luby M G, Mitzenmacher M, Shokrollahi M A, Spielman D A, Stemna V.Practical Loss-resilient Codes[C]. In Proceedings of the Twenty-ninth Annual ACM Symposium on Theory of Computing, El Paso, Texas, USA, May 1997:150- 159.
  • 8[1]J.W. Byers, M. Luby, M. Mitzenmacher, A. Rege, A digital fountain approach to reliable distribution of bulk data, available at http://www.icsi.berkeley. edu/~luby/, 1998.
  • 9[2]M. Luby, M. Mitzenmacher, A. Shokrollahi, D. Spielman, V. Stemann, Practical loss-resilientcodes, available at http://www.icsi.berkeley. edu/~luby/, 1998.
  • 10[3]P. Elias, Coding for two noisy channels, Information Theory, Third London Symposium, 1955,61-67.

共引文献25

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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