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

Using Chord for meta-data management in the N3FS distributed file system

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)
Anglano, C. ; Dipt. di Informatica, Univ. del Piemonte Orientale, Alessandria, Italy ; Ferrino, A.

In this paper we present two alternative ways of implementing a meta-data management subsystem for the N3FS distributed file system using Chord. In order to obtain high availability in presence of node failures and network losses, we develop solutions based either on replication or on redundancy. In order to assess the relative merits of these alternatives in terms of performance and availability, we performed an extensive simulation analysis. Our preliminary results indicate that, while there is not a clear winner in terms of absolute performance, the redundancy-based solution is characterized by an availability higher than the replication-based counterpart, especially in scenarios when node failures or network losses increase.

Published in:

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

Date of Conference:

8 Oct. 2004

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.