A Distributed Data Replication Protocol for File Versioning with Optimal Node Assignments

Takahiko Ikeda, Mamoru Ohara, S. Fukumoto, M. Arai, K. Iwasaki
{"title":"A Distributed Data Replication Protocol for File Versioning with Optimal Node Assignments","authors":"Takahiko Ikeda, Mamoru Ohara, S. Fukumoto, M. Arai, K. Iwasaki","doi":"10.1109/PRDC.2010.40","DOIUrl":null,"url":null,"abstract":"Some cloud storage services have recently introduced file versioning features by which more than one version of a file can be maintained. 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. 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":382974,"journal":{"name":"2010 IEEE 16th Pacific Rim International Symposium on Dependable Computing","volume":"68 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2010-12-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"5","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2010 IEEE 16th Pacific Rim International Symposium on Dependable Computing","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/PRDC.2010.40","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 5

Abstract

Some cloud storage services have recently introduced file versioning features by which more than one version of a file can be maintained. 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. 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.
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
基于最优节点分配的文件版本控制分布式数据复制协议
一些云存储服务最近引入了文件版本控制功能,通过该功能可以维护一个文件的多个版本。为了在有限的存储资源下提供文件版本控制,必须根据众多用户的不同需求将资源划分为不同的版本。在本文中,我们关注的是更有可能请求文件的新版本的应用程序,这在许多订阅服务的情况下可能是正确的。我们提出了一种支持文件版本控制特性的分布式数据复制协议。我们还构建了一个分析模型,当系统中副本节点总数和每个版本的读请求频率分布给定时,可以推导出资源的最优分配。此外,文中还给出了一些仿真算例,通过对实际参数的假设,说明了系统具有良好的可扩展性和可靠性。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
A Safe Measurement-Based Worst-Case Execution Time Estimation Using Automatic Test-Data Generation An Improved Knowledge Connectivity Condition for Fault-Tolerant Consensus with Unknown Participants On the Reliability of Cascaded TMR Systems A Learning-Based Approach to Secure Web Services from SQL/XPath Injection Attacks Address Remapping for Static NUCA in NoC-Based Degradable Chip-Multiprocessors
×
引用
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