o型环:点对点系统的容错和负载平衡架构

P. Melliar-Smith, L. Moser
{"title":"o型环:点对点系统的容错和负载平衡架构","authors":"P. Melliar-Smith, L. Moser","doi":"10.1109/SCCC.2009.15","DOIUrl":null,"url":null,"abstract":"O-Ring is a novel architecture that provides fault tolerance and load balancing for peer-to-peer systems. As the number of peers increases, faults become more frequent and fault tolerance becomes important. As the number of users increases, demand becomes more variable and load balancing becomes necessary. In O-Ring, data items are replicated on successive peers around the ring, with an overlap of data items stored at consecutive peers. Each peer holds data items for which it is directly responsible. It also holds backup copies of data items held by the peer preceding it on the ring and the peer following it on the ring. O-Ring allows peers to adjust their loads dynamically, without the overhead of transferring data items and without delay in request processing.","PeriodicalId":398661,"journal":{"name":"2009 International Conference of the Chilean Computer Science Society","volume":"20 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2009-11-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"6","resultStr":"{\"title\":\"O-Ring: A Fault Tolerance and Load Balancing Architecture for Peer-to-Peer Systems\",\"authors\":\"P. Melliar-Smith, L. Moser\",\"doi\":\"10.1109/SCCC.2009.15\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"O-Ring is a novel architecture that provides fault tolerance and load balancing for peer-to-peer systems. As the number of peers increases, faults become more frequent and fault tolerance becomes important. As the number of users increases, demand becomes more variable and load balancing becomes necessary. In O-Ring, data items are replicated on successive peers around the ring, with an overlap of data items stored at consecutive peers. Each peer holds data items for which it is directly responsible. It also holds backup copies of data items held by the peer preceding it on the ring and the peer following it on the ring. O-Ring allows peers to adjust their loads dynamically, without the overhead of transferring data items and without delay in request processing.\",\"PeriodicalId\":398661,\"journal\":{\"name\":\"2009 International Conference of the Chilean Computer Science Society\",\"volume\":\"20 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2009-11-10\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"6\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2009 International Conference of the Chilean Computer Science Society\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/SCCC.2009.15\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2009 International Conference of the Chilean Computer Science Society","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/SCCC.2009.15","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 6

摘要

O-Ring是一种为点对点系统提供容错和负载平衡的新型体系结构。随着对等体数量的增加,故障变得更加频繁,容错变得非常重要。随着用户数量的增加,需求变得更加多变,负载平衡变得必要。在O-Ring中,数据项在环周围的连续对等点上复制,在连续对等点上存储重叠的数据项。每个对等点持有它直接负责的数据项。它还保存在环上它前面的对等体和在环上它后面的对等体所保存的数据项的备份副本。O-Ring允许对等体动态调整其负载,而不需要传输数据项的开销,也不会延迟请求处理。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
O-Ring: A Fault Tolerance and Load Balancing Architecture for Peer-to-Peer Systems
O-Ring is a novel architecture that provides fault tolerance and load balancing for peer-to-peer systems. As the number of peers increases, faults become more frequent and fault tolerance becomes important. As the number of users increases, demand becomes more variable and load balancing becomes necessary. In O-Ring, data items are replicated on successive peers around the ring, with an overlap of data items stored at consecutive peers. Each peer holds data items for which it is directly responsible. It also holds backup copies of data items held by the peer preceding it on the ring and the peer following it on the ring. O-Ring allows peers to adjust their loads dynamically, without the overhead of transferring data items and without delay in request processing.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
Combining a Probabilistic Sampling Technique and Simple Heuristics to Solve the Dynamic Path Planning Problem Delayed Insertion Strategies in Dynamic Metric Indexes A Two-Level Calculus for Composing Hybrid QVT Transformations A Certified Access Controller for JME-MIDP 2.0 Enabled Mobile Devices Implementation of an Improvement Cycle Using the Competisoft Methodological Framework and the Tutelkan Platform
×
引用
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