A Self-organizing Data Store for Large Scale Distributed Infrastructures

Risse, Thomas; Knežević, Predrag

doi:10.1109/icde.2005.169

Cited by 10 publications

(5 citation statements)

References 11 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Other forms of storage that uses DHT as OceanStore [13] and Glacier [11] consider a simpler model where their nodes have equal probability of failure. BRICKS [24] consider availability instead reliability, associating a single fail probability to all nodes in the network.…”

Section: Related Workmentioning

confidence: 99%

“…The number of replicas needed to preserve a specific item is determined by the reliability metric of each repository. This allows an optimization of the network resources usage, compared to other systems where the number of replicas is fixed [17,24], however, more elaborated strategies for replication should be used in this case. Another contribution of this study is to present and compare three different strategies for the reliable replication problem.…”

Section: Introductionmentioning

confidence: 98%

See 1 more Smart Citation

Extending OAI-PMH over structured P2P networks for digital preservation

et al. 2012

View full text Add to dashboard Cite

Open archives initiative (OAI) allows both libraries and museums create and share their own low-cost digital libraries (DL). OAI DL are based on OAI-PMH protocol which, although is consolidated as a pattern for disseminating metadata, does not rely on either digital preservation and availability of content, essential requirements in this type of system. Building new mechanisms that guarantee improvements, at no or low cost increases, becomes a great challenge. This article proposes a distributed archiving system based on a P2P network, that allows OAI-based libraries to replicate digital objects to ensure their reliability and availability. The proposed system keeps and extends the current OAI-PMH protocol characteristics and is designed as a set of OAI repositories, where each repository has an independent fail probability assigned to it. Items are inserted with a reliability that is satisfied by replicating them in subsets of repositories. Communication between the nodes (repositories) of the network is organized in a distributed hash table and multiple hash functions are used to select repositories that keep the replicas of each stored item. The OAI characteristics combined with a structured P2P digital preservation system allow the construction of a reliable and totally distributed digital library. The archiving system has been evaluated through experiments in a real environment and the OAI-PMH extension validated by the implementation of a proof-of-principle prototype.

show abstract

Section: Related Workmentioning

confidence: 99%

Section: Introductionmentioning

confidence: 98%

Extending OAI-PMH over structured P2P networks for digital preservation

et al. 2012

View full text Add to dashboard Cite

show abstract

“…At the same time, the membership in the BRICKS community is very flexible; parties can join or leave the system at any time. BRICKS community needs to have service descriptions, administrative information about collections, ontologies and some annotations globally available all the time [1]. An important aspect is that data are changeable during the runtime, i.e.…”

Section: Introductionmentioning

confidence: 99%

Highly Available DHTs: Keeping Data Consistency After Updates

Knežević

Wombacher

Risse

2006

Lecture Notes in Computer Science

View full text Add to dashboard Cite

Abstract. The research in the paper is motivated by building a decentralized/P2P XML storage on top of a DHT (Distributed Hash Table). The storage must provide high data availability and support updates. High data availability in a DHT can be guaranteed by data replication. However, DHTs can not provide a centralized coordination guaranteeing data consistency upon updates. In particular, replicas may have different values due to concurrent updates or partitioning of the P2P network. An approach based on versioning of replica values is presented proposing a decentralized concurrency control system, where probabilistic guarantees can be provided for retrieving a correct replica value. This paper presents the protocol as well as a statistical analysis of the lower bound of the probabilistic guarantees.

show abstract

“…BRICKS community needs to have service descriptions, administrative information about collections, ontologies and some annotations globally available all the time [12]. An important aspect is that data are changeable during the run-time, i.e.…”

Section: Introductionmentioning

confidence: 99%