Managing and Recovering High Data Availability in a DHT under Churn

2006 International Conference on Collaborative Computing: Networking, Applications and Worksharing Pub Date : 2006-11-01 DOI:10.1109/COLCOM.2006.361874

P. Knezevic, A. Wombacher, T. Risse

{"title":"Managing and Recovering High Data Availability in a DHT under Churn","authors":"P. Knezevic, A. Wombacher, T. Risse","doi":"10.1109/COLCOM.2006.361874","DOIUrl":null,"url":null,"abstract":"An essential issue in peer-to-peer data management is to keep data highly available all the time. A common idea is to replicate data hoping that at least one replica is available when needed. However, due to churns, the number of created replicas could be not sufficient for guaranteeing the intended data availability. If the number of replicas is computed according to the lowest expected peer availability (a classical case), but the expectation were too high, then the peer availability after a churn could be too low, and the system could not be able to recover the requested data availability. The paper is a continuation of previous work (Knezevic et al., 2006) and presents a replication protocol that delivers a configured data availability guarantee, and is resistant to, or recovers fast from churns. The protocol is based on a distributed hash table (DHT), measurement of peer online probability in the system, and adjustment of the number of replicas accordingly. The evaluation shows that we are able to maintain or recover the requested data availability during or shortly after stronger or weaker churns, and at the same time the storage overhead is close to the theoretical minimum","PeriodicalId":315775,"journal":{"name":"2006 International Conference on Collaborative Computing: Networking, Applications and Worksharing","volume":"1 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2006-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"7","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2006 International Conference on Collaborative Computing: Networking, Applications and Worksharing","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/COLCOM.2006.361874","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}

引用次数: 7

Abstract

An essential issue in peer-to-peer data management is to keep data highly available all the time. A common idea is to replicate data hoping that at least one replica is available when needed. However, due to churns, the number of created replicas could be not sufficient for guaranteeing the intended data availability. If the number of replicas is computed according to the lowest expected peer availability (a classical case), but the expectation were too high, then the peer availability after a churn could be too low, and the system could not be able to recover the requested data availability. The paper is a continuation of previous work (Knezevic et al., 2006) and presents a replication protocol that delivers a configured data availability guarantee, and is resistant to, or recovers fast from churns. The protocol is based on a distributed hash table (DHT), measurement of peer online probability in the system, and adjustment of the number of replicas accordingly. The evaluation shows that we are able to maintain or recover the requested data availability during or shortly after stronger or weaker churns, and at the same time the storage overhead is close to the theoretical minimum

查看原文本刊更多论文

在DHT中管理和恢复高数据可用性

点对点数据管理的一个基本问题是始终保持数据的高可用性。一个常见的想法是复制数据，希望在需要时至少有一个副本可用。但是，由于频繁切换，创建的副本数量可能不足以保证预期的数据可用性。如果副本的数量是根据最低期望的对等可用性计算的(典型情况)，但是期望过高，那么在中断后对等可用性可能过低，系统无法恢复所请求的数据可用性。这篇论文是之前工作(Knezevic et al.， 2006)的延续，并提出了一种复制协议，该协议提供了配置的数据可用性保证，并且可以抵抗或从中断中快速恢复。该协议基于分布式哈希表(DHT)，测量系统中对等在线的概率，并相应地调整副本的数量。评估表明，我们能够在较强或较弱的震荡期间或之后不久维护或恢复所请求的数据可用性，同时存储开销接近理论最小值

本文章由计算机程序翻译，如有差异，请以英文原文为准。

求助全文

约1分钟内获得全文求助全文

来源期刊

2006 International Conference on Collaborative Computing: Networking, Applications and Worksharing

自引率

0.00%

发文量