A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2014; you can also visit <a rel="external noopener" href="http://hal.inria.fr/docs/00/60/79/15/PDF/2011_-_TLDKS_-_Replication_in_DHTs_using_Dynamic_Groups.pdf">the original URL</a>. The file type is <code>application/pdf</code>.
Replication in DHTs Using Dynamic Groups
[chapter]
<span title="">2011</span>
<i title="Springer Berlin Heidelberg">
<a target="_blank" rel="noopener" href="https://fatcat.wiki/container/2w3awgokqne6te4nvlofavy5a4" style="color: black;">Lecture Notes in Computer Science</a>
</i>
Preserved Fulltext
Distributed Hash Tables (DHTs) provide an efficient solution for data location and lookup in large-scale P2P systems. However, it is up to the applications to deal with the availability of the data they store in the DHT, e.g. via replication. To improve data availability, most DHT applications rely on data replication. However, efficient replication management is quite challenging, in particular because of concurrent and missed updates. In this paper, we propose a complete solution to data
<span class="external-identifiers">
<a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1007/978-3-642-23074-5_1">doi:10.1007/978-3-642-23074-5_1</a>
<a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/2ejo52smf5bahfuquozlv65zxe">fatcat:2ejo52smf5bahfuquozlv65zxe</a>
</span>
more »
... cation in DHTs. We propose a new service, called Continuous Timestamp based Replication Management (CTRM), which deals with the efficient storage, retrieval and updating of replicas in DHTs. In CTRM, the replicas are maintained by groups of peers which are determined dynamically using a hash function. To perform updates on replicas, we propose a new protocol that stamps the updates with timestamps that are generated in a distributed fashion using the dynamic groups. Timestamps are not only monotonically increasing but also continuous, i.e. without gap. The property of monotonically increasing allows applications to determine a total order on updates. The other property, i.e. continuity, enables applications to deal with missed updates. We evaluated the performance of our solution through simulation and experimentation. The results show its effectiveness for replication management in DHTs. * Work partially funded by the ANR DataRing projet.
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20140830121313/http://hal.inria.fr/docs/00/60/79/15/PDF/2011_-_TLDKS_-_Replication_in_DHTs_using_Dynamic_Groups.pdf" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext">
<button class="ui simple right pointing dropdown compact black labeled icon button serp-button">
<i class="icon ia-icon"></i>
Web Archive
[PDF]
<div class="menu fulltext-thumbnail">
<img src="https://blobs.fatcat.wiki/thumbnail/pdf/fe/27/fe27e75ad1b578f45f562d868febef5e34333f3b.180px.jpg" alt="fulltext thumbnail" loading="lazy">
</div>
</button>
</a>
<a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1007/978-3-642-23074-5_1">
<button class="ui left aligned compact blue labeled icon button serp-button">
<i class="external alternate icon"></i>
springer.com
</button>
</a>