基于客户端的多版本云文件存储复制协议

Mamoru Ohara, S. Fukumoto
{"title":"基于客户端的多版本云文件存储复制协议","authors":"Mamoru Ohara, S. Fukumoto","doi":"10.1109/SRDSW.2015.17","DOIUrl":null,"url":null,"abstract":"In recent years, data replication have received attention in terms of tolerance for large-scale disasters. Also, file versioning features, by which more than one version of a file can be maintained, have been commercially available in some storage services. For providing file versioning with limited storage resources, it is essential to divide the resources among versions in accordance with the varied needs of numerous users. In this paper, we focus on applications in which newer versions of a file are more likely to be requested, which may be true in the case of many subscription services. We propose a new distributed data replication protocol supporting the file versioning feature. In order to eliminate a single point of failure, replica nodes themselves do not know about which nodes hold the newest version, instead, clients dynamically search the nodes having the required version in read/write operations. We also construct an analytical model that can derive an optimal allocation of the resources when the total number of replica nodes in a system and the distribution of the frequency of read requests for each version are given. In addition, we present some numerical examples obtained by simulations to show the good scalability and dependability of our system by assuming some realistic parameters.","PeriodicalId":415692,"journal":{"name":"2015 IEEE 34th Symposium on Reliable Distributed Systems Workshop (SRDSW)","volume":"16 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2015-09-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":"{\"title\":\"A Client-Based Replication Protocol for Multiversion Cloud File Storage\",\"authors\":\"Mamoru Ohara, S. Fukumoto\",\"doi\":\"10.1109/SRDSW.2015.17\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"In recent years, data replication have received attention in terms of tolerance for large-scale disasters. Also, file versioning features, by which more than one version of a file can be maintained, have been commercially available in some storage services. For providing file versioning with limited storage resources, it is essential to divide the resources among versions in accordance with the varied needs of numerous users. In this paper, we focus on applications in which newer versions of a file are more likely to be requested, which may be true in the case of many subscription services. We propose a new distributed data replication protocol supporting the file versioning feature. In order to eliminate a single point of failure, replica nodes themselves do not know about which nodes hold the newest version, instead, clients dynamically search the nodes having the required version in read/write operations. We also construct an analytical model that can derive an optimal allocation of the resources when the total number of replica nodes in a system and the distribution of the frequency of read requests for each version are given. In addition, we present some numerical examples obtained by simulations to show the good scalability and dependability of our system by assuming some realistic parameters.\",\"PeriodicalId\":415692,\"journal\":{\"name\":\"2015 IEEE 34th Symposium on Reliable Distributed Systems Workshop (SRDSW)\",\"volume\":\"16 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2015-09-28\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"1\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2015 IEEE 34th Symposium on Reliable Distributed Systems Workshop (SRDSW)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/SRDSW.2015.17\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2015 IEEE 34th Symposium on Reliable Distributed Systems Workshop (SRDSW)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/SRDSW.2015.17","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 1

摘要

近年来,数据复制在对大规模灾难的容忍度方面受到了关注。此外,文件版本控制功能(通过该功能可以维护一个文件的多个版本)在一些存储服务中已经商业化。为了在有限的存储资源下提供文件版本控制,必须根据众多用户的不同需求将资源划分为不同的版本。在本文中,我们关注的是更有可能请求文件的新版本的应用程序,这在许多订阅服务的情况下可能是正确的。我们提出了一种支持文件版本控制特性的分布式数据复制协议。为了消除单点故障,副本节点本身并不知道哪些节点拥有最新版本,相反,客户机在读/写操作中动态搜索具有所需版本的节点。我们还构建了一个分析模型,当系统中副本节点总数和每个版本的读请求频率分布给定时,可以推导出资源的最优分配。此外,文中还给出了一些仿真算例,通过对实际参数的假设,说明了系统具有良好的可扩展性和可靠性。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
A Client-Based Replication Protocol for Multiversion Cloud File Storage
In recent years, data replication have received attention in terms of tolerance for large-scale disasters. Also, file versioning features, by which more than one version of a file can be maintained, have been commercially available in some storage services. For providing file versioning with limited storage resources, it is essential to divide the resources among versions in accordance with the varied needs of numerous users. In this paper, we focus on applications in which newer versions of a file are more likely to be requested, which may be true in the case of many subscription services. We propose a new distributed data replication protocol supporting the file versioning feature. In order to eliminate a single point of failure, replica nodes themselves do not know about which nodes hold the newest version, instead, clients dynamically search the nodes having the required version in read/write operations. We also construct an analytical model that can derive an optimal allocation of the resources when the total number of replica nodes in a system and the distribution of the frequency of read requests for each version are given. In addition, we present some numerical examples obtained by simulations to show the good scalability and dependability of our system by assuming some realistic parameters.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信