By Topic

An empirical study of data redundancy for high availability in large overlay networks

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

1 Author(s)
Chiola, G. ; Dipt. di Informatica e Sci. dell''Informazione, Universita di Genova, Italy

Redundancy is crucial for high data availability in an environment where computing nodes and/or communication channels are subject to transient failures, such as the Internet. Various techniques ranging from (multiple) replication to more sophisticated erasure correction coding have been studied. To the best of our knowledge, however, no easy rule of thumb has been devised to guide the distributed application designer in the choice of the appropriate technique and the right level of redundancy to guarantee the desired level of data availability. In this paper we present some simulation results that could help clarify the relation between the redundancy technique we adopted and the expected data availability in the context of medium to large size overlay networks, such as a Chord-like DHT.

Published in:

Hot Topics in Peer-to-Peer Systems, 2005. HOT-P2P 2005. Second International Workshop on

Date of Conference:

21 July 2005