%0 Conference Paper %1 ofelectrical2006collaborative %A Knezevic, Predrag %A Wombacher, Andreas %A Risse, Thomas %B International Conference on Collaborative Computing : Networking, Applications and Worksharing, 2006. CollaborateCom 2006. %D 2006 %I IEEE %K availability bricks churn myown p2p replication self-organization %P 1-10 %T Managing and Recovering High Data Availability in a DHT under Churn %X 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 %@ 1424404290 9781424404292

@inproceedings{ofelectrical2006collaborative, 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}, added-at = {2012-07-05T09:00:37.000+0200}, author = {Knezevic, Predrag and Wombacher, Andreas and Risse, Thomas}, biburl = {https://www.bibsonomy.org/bibtex/2a0278edc108faca633c2cc58f8aa3ef2/trisse69}, booktitle = {International Conference on Collaborative Computing : Networking, Applications and Worksharing, 2006. CollaborateCom 2006.}, interhash = {2890f219876a636bd6ee4e1fe07ac80e}, intrahash = {a0278edc108faca633c2cc58f8aa3ef2}, isbn = {1424404290 9781424404292}, keywords = {availability bricks churn myown p2p replication self-organization}, pages = {1-10}, publisher = {IEEE}, refid = {756545707}, timestamp = {2012-07-05T10:13:56.000+0200}, title = {Managing and Recovering High Data Availability in a DHT under Churn}, year = 2006 }