By Topic

Reliability of data in structured peer-to-peer systems

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

5 Author(s)
Rieche, Simon ; Protocol Eng. & Distributed Syst. Group, Tubingen Univ., Germany ; Wehrle, K. ; Landsiedel, O. ; Götz, S.
more authors

Peer-to-peer (P2P) systems are very useful for managing large amounts of widely distributed data. For this purpose distributed hash tables (DHT) offer a highly scalable and self-organizing paradigm for efficient distribution and retrieval of data. Thereby a common assumption of P2P systems is, that the participating nodes are unreliable and may fail at any time. Since many of research goes into the design of DHT lookup services, these systems aim to provide a stable global addressing structure. But to storage data reliable in a DHT only few techniques were already developed. However since data has to be stored persistent in the network, it should be retrieved anytime, even if nodes fail. In this work we discuss possibilities to store data fault tolerant in a structured peer-to-peer system.

Published in:

Peer-to-Peer Systems, 2004. International Workshop on Hot Topics in

Date of Conference:

8 Oct. 2004