Cart (Loading....) | Create Account
Close category search window
 

Reperasure: replication protocol using erasure-code in peer-to-peer storage network

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

2 Author(s)

Peer-to-peer overlay networks offer a convenient way to host an infrastructure that can scale to the size of the Internet and yet stay manageable. These overlays are essentially self-organizing distributed hash tables (DHT). The dynamic nature of the system, however, poses serious challenges of data reliability. Furthermore, in order to see wider adoption, it is time to design support for generic replication mechanisms capable of handling arbitrary update requests - most of the existing proposals are deep archival systems in nature. Utilizing the fact that DHT can function as a super-reliable and high performance disk when data stored inside are erasure coded, we believe practical and simple protocols can be designed. In this paper, we introduce the reperasure protocol, a layer on top of the basic DHT, which efficiently supports strong consistency semantic with high availability guarantee. By relieving the DHT layer out of replication duo, inside, a cleaner overall architecture can be derived because of the clear division of responsibility.

Published in:

Reliable Distributed Systems, 2002. Proceedings. 21st IEEE Symposium on

Date of Conference:

2002

Need Help?


IEEE Advancing Technology for Humanity About IEEE Xplore | Contact | Help | Terms of Use | Nondiscrimination Policy | Site Map | Privacy & Opting Out of Cookies

A not-for-profit organization, IEEE is the world's largest professional association for the advancement of technology.
© Copyright 2014 IEEE - All rights reserved. Use of this web site signifies your agreement to the terms and conditions.