节点文献
Peer-to-Peer存储系统中一种高效的数据维护方案
Efficient Data Maintenance Scheme for Peer-to-Peer Storage Systems
【摘要】 提出一套完整的数据维护方案.该方案建立在P2P环境动态性特点的基础上.一方面,该方案考虑了节点动态性差异,它基于不同的动态性作相应的数据冗余,能够用更少的冗余开销来保证数据的目标可用性;另一方面,该方案给出如何利用判别器来区分永久失效和暂时失效,以减少由于不必要的数据修复而带来的额外修复开销.通过在真实P2P系统Maze上的实验结果表明,该方案比目前主流的方案能够节省大约80%的数据维护带宽.
【Abstract】 This paper presents a new scheme based on the dynamical characteristics of P2P systems.First, the differences in node availability are taken into consideration, and a new data placement algorithm using less redundancy to guarantee target data availability is proposed.Second, permanent failure detector is used to distinguish between permanent and transient failures, which can reduce data recovery cost by decreasing the number of unnecessary repairs.Results from a trace-driven simulation suggest that this scheme can reduce about 80% maintenance bandwidth, compared with traditional methods.
【Key words】 peer-to-peer storage; data maintenance; permanent failure; transient failure; failure detection; bandwidth optimization;
- 【文献出处】 软件学报 ,Journal of Software , 编辑部邮箱 ,2009年01期
- 【分类号】TP333
- 【被引频次】11
- 【下载频次】435