云数据中心的安全块级重复数据删除方法

Gulsayyar Ali, Mian Ilyas Ahmad, Arslan Rafi
{"title":"云数据中心的安全块级重复数据删除方法","authors":"Gulsayyar Ali, Mian Ilyas Ahmad, Arslan Rafi","doi":"10.1109/iCoMET48670.2020.9074109","DOIUrl":null,"url":null,"abstract":"The ongoing growth in information and technology sector has increased storage requirement in cloud data centers with unprecedented pace. Global storage reached 2.8 trillion GB as per EMC Digital Universe study 2012 [1] and will reach 5247GB per user by 2020. Data redundancy is one of the root factors in storage scarcity because clients upload data without knowing the content available on the server. Ponemon Institute detected 18% redundant data in \"National Survey on Data Centers Outages\" [15]. To resolve this issue, the concept of data deduplication is used, where each file has a unique hash identifier that changes with the content of the file. If a client tries to save duplicate of an existing file, he/she receives a pointer for retrieving the existing file. In this way, data deduplication helps in storage reduction and identifying redundant copies of the same files stored at data centers. Therefore, many popular cloud storage vendors like Amazon, Google Dropbox, IBM Cloud, Microsoft Azure, Spider Oak, Waula and Mozy adopted data deduplication. In this study, we have made a comparison of commonly used File-level deduplication with our proposed Block-level deduplication for cloud data centers. We implemented the two deduplication approaches on a local dataset and demonstrated that the proposed Block-level deduplication approach shows 5% better results as compared to the File-level deduplication approach. Furthermore, we expect that the performance will further be improved by considering a large dataset with more users working in similar domain.","PeriodicalId":431051,"journal":{"name":"2020 3rd International Conference on Computing, Mathematics and Engineering Technologies (iCoMET)","volume":"319 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2020-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"2","resultStr":"{\"title\":\"Secure Block-level Data Deduplication approach for Cloud Data Centers\",\"authors\":\"Gulsayyar Ali, Mian Ilyas Ahmad, Arslan Rafi\",\"doi\":\"10.1109/iCoMET48670.2020.9074109\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"The ongoing growth in information and technology sector has increased storage requirement in cloud data centers with unprecedented pace. Global storage reached 2.8 trillion GB as per EMC Digital Universe study 2012 [1] and will reach 5247GB per user by 2020. Data redundancy is one of the root factors in storage scarcity because clients upload data without knowing the content available on the server. Ponemon Institute detected 18% redundant data in \\\"National Survey on Data Centers Outages\\\" [15]. To resolve this issue, the concept of data deduplication is used, where each file has a unique hash identifier that changes with the content of the file. If a client tries to save duplicate of an existing file, he/she receives a pointer for retrieving the existing file. In this way, data deduplication helps in storage reduction and identifying redundant copies of the same files stored at data centers. Therefore, many popular cloud storage vendors like Amazon, Google Dropbox, IBM Cloud, Microsoft Azure, Spider Oak, Waula and Mozy adopted data deduplication. In this study, we have made a comparison of commonly used File-level deduplication with our proposed Block-level deduplication for cloud data centers. We implemented the two deduplication approaches on a local dataset and demonstrated that the proposed Block-level deduplication approach shows 5% better results as compared to the File-level deduplication approach. Furthermore, we expect that the performance will further be improved by considering a large dataset with more users working in similar domain.\",\"PeriodicalId\":431051,\"journal\":{\"name\":\"2020 3rd International Conference on Computing, Mathematics and Engineering Technologies (iCoMET)\",\"volume\":\"319 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 3rd International Conference on Computing, Mathematics and Engineering Technologies (iCoMET)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/iCoMET48670.2020.9074109\",\"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 3rd International Conference on Computing, Mathematics and Engineering Technologies (iCoMET)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/iCoMET48670.2020.9074109","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 2

摘要

信息和技术领域的持续增长以前所未有的速度增加了云数据中心的存储需求。根据2012年EMC数字宇宙研究[1],全球存储容量达到2.8万亿GB,到2020年将达到每个用户5247GB。数据冗余是存储稀缺的根本因素之一,因为客户机上传数据时不知道服务器上可用的内容。Ponemon Institute在“全国数据中心宕机调查”中发现18%的冗余数据[15]。为了解决这个问题,使用了重复数据删除的概念,其中每个文件都有一个唯一的哈希标识符,该标识符随文件内容的变化而变化。如果客户端试图保存现有文件的副本,他/她将收到一个指针,用于检索现有文件。通过这种方式,数据重复删除有助于减少存储空间,并识别存储在数据中心的相同文件的冗余副本。因此,许多流行的云存储供应商,如亚马逊、谷歌Dropbox、IBM cloud、微软Azure、Spider Oak、Waula和Mozy,都采用了重复数据删除。在本研究中,我们将常用的文件级重复数据删除与我们提出的用于云数据中心的块级重复数据删除进行了比较。我们在一个本地数据集上实现了这两种重复数据删除方法,并证明了提议的块级重复数据删除方法比文件级重复数据删除方法的效果好5%。此外,我们期望通过考虑具有更多用户在相似领域工作的大型数据集,性能将进一步提高。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
Secure Block-level Data Deduplication approach for Cloud Data Centers
The ongoing growth in information and technology sector has increased storage requirement in cloud data centers with unprecedented pace. Global storage reached 2.8 trillion GB as per EMC Digital Universe study 2012 [1] and will reach 5247GB per user by 2020. Data redundancy is one of the root factors in storage scarcity because clients upload data without knowing the content available on the server. Ponemon Institute detected 18% redundant data in "National Survey on Data Centers Outages" [15]. To resolve this issue, the concept of data deduplication is used, where each file has a unique hash identifier that changes with the content of the file. If a client tries to save duplicate of an existing file, he/she receives a pointer for retrieving the existing file. In this way, data deduplication helps in storage reduction and identifying redundant copies of the same files stored at data centers. Therefore, many popular cloud storage vendors like Amazon, Google Dropbox, IBM Cloud, Microsoft Azure, Spider Oak, Waula and Mozy adopted data deduplication. In this study, we have made a comparison of commonly used File-level deduplication with our proposed Block-level deduplication for cloud data centers. We implemented the two deduplication approaches on a local dataset and demonstrated that the proposed Block-level deduplication approach shows 5% better results as compared to the File-level deduplication approach. Furthermore, we expect that the performance will further be improved by considering a large dataset with more users working in similar domain.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
Detecting Faulty Sensors by Analyzing the Uncertain Data Using Probabilistic Database Construction of the Exact Solution of Ripa Model with Primitive Variable Approach A Review on Hybrid Energy Storage Systems in Microgrids Meta-model for Stress Testing on Blockchain Nodes Ethics of Artificial Intelligence: Research Challenges and Potential Solutions
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1