通过OpenStack Swift动态分配复制码和Erasure码，提高存储效率

2020 International Conference on Electronics, Information, and Communication (ICEIC) Pub Date : 2020-01-01 DOI:10.1109/ICEIC49074.2020.9051133

Cheong-Jin Ahn, M. Pirahandeh, Deok‐Hwan Kim

{"title":"通过OpenStack Swift动态分配复制码和Erasure码，提高存储效率","authors":"Cheong-Jin Ahn, M. Pirahandeh, Deok‐Hwan Kim","doi":"10.1109/ICEIC49074.2020.9051133","DOIUrl":null,"url":null,"abstract":"The object storage system introduced data redundancy techniques such as replication and erasure codes to build a reliable system. However, replication method has storage efficiency problem with large and less frequently accessed data types, and erase coding method has performance problem with small and frequently accessed data types. In this paper, we propose a dynamic allocation of replication and erasure coding approach (DARE) to improve storage efficiency and performance using access frequency and object size factors. Experimental results show that the proposed DARE can improve storage efficiency by 21 percent compared to the traditional resilient system","PeriodicalId":271345,"journal":{"name":"2020 International Conference on Electronics, Information, and Communication (ICEIC)","volume":"20 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2020-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"2","resultStr":"{\"title\":\"Dynamic Allocation of Replication and Erasure Codes for Enhancing Storage Efficiency in OpenStack Swift\",\"authors\":\"Cheong-Jin Ahn, M. Pirahandeh, Deok‐Hwan Kim\",\"doi\":\"10.1109/ICEIC49074.2020.9051133\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"The object storage system introduced data redundancy techniques such as replication and erasure codes to build a reliable system. However, replication method has storage efficiency problem with large and less frequently accessed data types, and erase coding method has performance problem with small and frequently accessed data types. In this paper, we propose a dynamic allocation of replication and erasure coding approach (DARE) to improve storage efficiency and performance using access frequency and object size factors. Experimental results show that the proposed DARE can improve storage efficiency by 21 percent compared to the traditional resilient system\",\"PeriodicalId\":271345,\"journal\":{\"name\":\"2020 International Conference on Electronics, Information, and Communication (ICEIC)\",\"volume\":\"20 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2020-01-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"2\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2020 International Conference on Electronics, Information, and Communication (ICEIC)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ICEIC49074.2020.9051133\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2020 International Conference on Electronics, Information, and Communication (ICEIC)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICEIC49074.2020.9051133","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}

引用次数: 2

摘要

对象存储系统引入了复制、erasure code等数据冗余技术，构建了可靠的系统。但是，对于大数据类型和访问频率较低的数据类型，复制方法存在存储效率问题，对于小数据类型和访问频率较高的数据类型，擦除编码方法存在性能问题。在本文中，我们提出了一种动态分配复制和擦除编码方法(DARE)，以提高存储效率和性能，利用访问频率和对象大小因素。实验结果表明，与传统弹性系统相比，该系统可提高21%的存储效率

本文章由计算机程序翻译，如有差异，请以英文原文为准。

查看原文本刊更多论文

Dynamic Allocation of Replication and Erasure Codes for Enhancing Storage Efficiency in OpenStack Swift

The object storage system introduced data redundancy techniques such as replication and erasure codes to build a reliable system. However, replication method has storage efficiency problem with large and less frequently accessed data types, and erase coding method has performance problem with small and frequently accessed data types. In this paper, we propose a dynamic allocation of replication and erasure coding approach (DARE) to improve storage efficiency and performance using access frequency and object size factors. Experimental results show that the proposed DARE can improve storage efficiency by 21 percent compared to the traditional resilient system

求助全文

通过发布文献求助，成功后即可免费获取论文全文。去求助

来源期刊

2020 International Conference on Electronics, Information, and Communication (ICEIC)

自引率

0.00%

发文量