An essential issue in peer-to-peer data management is to keep data highly available all the time. The paper presents a replication protocol that adjusts autonomously the number of replicas to deliver a configured data availability guarantee. 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 the requested data availability achieving near to optimal storage costs, independent of the number of replicas used during the initialization of the system.
%0 Conference Paper
%1 Knezevic:2009:DSR:1537834.1537856
%A Knezević, Predrag
%A Wombacher, Andreas
%A Risse, Thomas
%B Advanced Internet Based Systems and Applications
%C Berlin, Heidelberg
%D 2009
%E Damiani, Ernesto
%E Yetongnon, Kokou
%E Chbeir, Richard
%E Dipanda, Albert
%I Springer-Verlag
%K availability bricks myown p2p replication
%P 201--210
%R 10.1007/978-3-642-01350-8_19
%T DHT-Based Self-adapting Replication Protocol for Achieving High Data Availability
%U http://dx.doi.org/10.1007/978-3-642-01350-8_19
%X An essential issue in peer-to-peer data management is to keep data highly available all the time. The paper presents a replication protocol that adjusts autonomously the number of replicas to deliver a configured data availability guarantee. 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 the requested data availability achieving near to optimal storage costs, independent of the number of replicas used during the initialization of the system.
%@ 978-3-642-01349-2
@inproceedings{Knezevic:2009:DSR:1537834.1537856,
abstract = {An essential issue in peer-to-peer data management is to keep data highly available all the time. The paper presents a replication protocol that adjusts autonomously the number of replicas to deliver a configured data availability guarantee. 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 the requested data availability achieving near to optimal storage costs, independent of the number of replicas used during the initialization of the system.},
acmid = {1537856},
added-at = {2012-07-05T09:06:32.000+0200},
address = {Berlin, Heidelberg},
author = {Kne\v{z}evi\'{c}, Predrag and Wombacher, Andreas and Risse, Thomas},
biburl = {https://www.bibsonomy.org/bibtex/24ebd1517962736fcf7587af5b28dbff0/trisse69},
booktitle = {Advanced Internet Based Systems and Applications},
doi = {10.1007/978-3-642-01350-8_19},
editor = {Damiani, Ernesto and Yetongnon, Kokou and Chbeir, Richard and Dipanda, Albert},
interhash = {b8afabb37227a31e968d74c00f653873},
intrahash = {4ebd1517962736fcf7587af5b28dbff0},
isbn = {978-3-642-01349-2},
keywords = {availability bricks myown p2p replication},
numpages = {10},
pages = {201--210},
publisher = {Springer-Verlag},
timestamp = {2013-10-28T17:31:33.000+0100},
title = {DHT-Based Self-adapting Replication Protocol for Achieving High Data Availability},
url = {http://dx.doi.org/10.1007/978-3-642-01350-8_19},
year = 2009
}