Enhancements to CAN for the application as distributed data storage system in grids

Henry Ristau; Daniel Versick; Djamshid Tavangarian

2nd International ICST Conference on Broadband Networks

Research Article

Enhancements to CAN for the application as distributed data storage system in grids

Cite: BibTeX Plain Text

@INPROCEEDINGS{10.1109/ICBN.2005.1589765,
    author={Henry Ristau and Daniel Versick and Djamshid Tavangarian},
    title={Enhancements to CAN for the application as distributed data storage system in grids},
    proceedings={2nd International ICST Conference on Broadband Networks},
    publisher={IEEE},
    proceedings_a={BROADNETS},
    year={2006},
    month={2},
    keywords={},
    doi={10.1109/ICBN.2005.1589765}
}

Henry Ristau
Daniel Versick
Djamshid Tavangarian
Year: 2006
Enhancements to CAN for the application as distributed data storage system in grids
BROADNETS
IEEE
DOI: 10.1109/ICBN.2005.1589765

Henry Ristau¹^,*, Daniel Versick¹^,*, Djamshid Tavangarian¹^,*

1: Chair of Computer Architecture, Department of Computer Science, University of Rostock, Albert-Einstein-Straße 21, D-18059 Rostock, Germany

*Contact email: henry.ristau@uni-rostock.de, daniel.versick@uni-rostock.de, djamshid.tavangarian@uni-rostock.de

Abstract

Currently, there is no distributed data management system for computational grids that provides transparent data distribution and replication. This paper introduces three methods to enhance an algorithm for data distribution and replication from the field of peer-to-peer computing named "content-addressable network". They enable this algorithm to being a basis for a fully transparent distributed data management system for grids. The first enhancement provides multiple dataset queries which allow the user to search for all datasets matching a given combination of key and mask. Another optimization reduces existing query latencies by introducing a system of specifically selected short cuts. The third enhancement enables the algorithm to keep the amount of data stored on a certain node more equally balanced and as a result optimizes the algorithms stability while working with high data fill-levels

Published: 2006-02-13
Publisher: IEEE

: http://dx.doi.org/10.1109/ICBN.2005.1589765