结构化点对点覆盖网络中数据可用性的平稳自适应复制方法

Xuezheng Liu, Guangwen Yang, Dingxing Wang
{"title":"结构化点对点覆盖网络中数据可用性的平稳自适应复制方法","authors":"Xuezheng Liu, Guangwen Yang, Dingxing Wang","doi":"10.1109/ICON.2003.1266201","DOIUrl":null,"url":null,"abstract":"Structured peer-to-peer overlay networks offer a novel infrastructure for large-scale applications. However, replications aimed for high data availability often have too much maintenance cost. In this paper we propose a simple and efficient replication strategy over low available peers, which has stationary replica locations and variation-tolerant data recovery mechanism, so that it can greatly reduce the costs for maintaining replicas, esp. in the circumstance of poor peer availabilities. We also present an analytic model for data availability and replication maintenance costs. Based on our model, we make adaptive mechanism for replicas checking, which can further reduce the cost and guarantee data availability in variable circumstance and conditions for living replicas. The simulation results proved the contribution of our approach and model.","PeriodicalId":122389,"journal":{"name":"The 11th IEEE International Conference on Networks, 2003. ICON2003.","volume":"60 10","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2003-09-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"4","resultStr":"{\"title\":\"Stationary and adaptive replication approach to data availability in structured peer-to-peer overlay networks\",\"authors\":\"Xuezheng Liu, Guangwen Yang, Dingxing Wang\",\"doi\":\"10.1109/ICON.2003.1266201\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Structured peer-to-peer overlay networks offer a novel infrastructure for large-scale applications. However, replications aimed for high data availability often have too much maintenance cost. In this paper we propose a simple and efficient replication strategy over low available peers, which has stationary replica locations and variation-tolerant data recovery mechanism, so that it can greatly reduce the costs for maintaining replicas, esp. in the circumstance of poor peer availabilities. We also present an analytic model for data availability and replication maintenance costs. Based on our model, we make adaptive mechanism for replicas checking, which can further reduce the cost and guarantee data availability in variable circumstance and conditions for living replicas. The simulation results proved the contribution of our approach and model.\",\"PeriodicalId\":122389,\"journal\":{\"name\":\"The 11th IEEE International Conference on Networks, 2003. ICON2003.\",\"volume\":\"60 10\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2003-09-28\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"4\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"The 11th IEEE International Conference on Networks, 2003. ICON2003.\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ICON.2003.1266201\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"The 11th IEEE International Conference on Networks, 2003. ICON2003.","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICON.2003.1266201","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 4

摘要

结构化点对点覆盖网络为大规模应用提供了一种新的基础设施。然而,以高数据可用性为目标的复制往往有过高的维护成本。本文提出了一种简单有效的低可用节点复制策略,该策略具有固定的副本位置和容差数据恢复机制,从而大大降低了副本的维护成本,特别是在低可用节点的情况下。我们还提出了一个数据可用性和复制维护成本的分析模型。在此基础上,建立了副本检测的自适应机制,进一步降低了成本,保证了活副本在可变环境和条件下的数据可用性。仿真结果证明了我们的方法和模型的贡献。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Stationary and adaptive replication approach to data availability in structured peer-to-peer overlay networks
Structured peer-to-peer overlay networks offer a novel infrastructure for large-scale applications. However, replications aimed for high data availability often have too much maintenance cost. In this paper we propose a simple and efficient replication strategy over low available peers, which has stationary replica locations and variation-tolerant data recovery mechanism, so that it can greatly reduce the costs for maintaining replicas, esp. in the circumstance of poor peer availabilities. We also present an analytic model for data availability and replication maintenance costs. Based on our model, we make adaptive mechanism for replicas checking, which can further reduce the cost and guarantee data availability in variable circumstance and conditions for living replicas. The simulation results proved the contribution of our approach and model.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
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学术文献互助群
群 号:604180095
Book学术官方微信