By Topic

Enabling High Data Availability in a DHT

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

3 Author(s)
Knezevic, P. ; Integrated Publication & Inf. Syst. Inst., Fraunhofer IPSI, Darmstadt ; Wombacher, A. ; Risse, T.

Many decentralized and peer-to-peer applications require some sort of data management. Besides P2P file-sharing, there are already scenarios (e.g. BRICKS project) that need management of finer-grained objects including updates and, keeping them highly available in very dynamic communities of peers. In order to achieve project goals and fulfill the requirements, a decentralized/P2P XML storage on top of a DHT (distributed hash table) overlay has been proposed. Unfortunately, DHTs do not provide any guarantees that data will be highly available all the time. A self-managed approach is proposed where availability is stochastically guaranteed by using a replication protocol. The protocol recreates periodically missing replicas dependent on the availability of peers. We are able to minimize generated costs for requested data availability. The protocol is fully decentralized and adapts itself on changes in community maintaining the requested availability. Finally, the approach is evaluated and compared with replication mechanisms embedded in other decentralized storages

Published in:

Database and Expert Systems Applications, 2005. Proceedings. Sixteenth International Workshop on

Date of Conference:

26-26 Aug. 2005