LH*s: a high-availability and high-security scalable distributed data structure

Litwin, Witold; Neimat, Marie-Anne; Lev, G.; Ndiaye, Samba; Seck, T.

doi:10.1109/ride.1997.583720

Cited by 13 publications

(12 citation statements)

References 11 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Many recent fault-tolerant systems achieve throughputscalability by partitioning the services and data structures they provide (e.g., [24,13,3,34,25,38]). By partitioning different objects into different server groups, throughput scales with the addition of servers.…”

Section: Throughput-scalabilitymentioning

confidence: 99%

“…By partitioning different objects into different server groups, throughput scales with the addition of servers. However, to partition, these systems either forego the ability to perform operations that span objects (e.g., [24,13,34,38]) or make use of a special protocol/service for "transactions" that span objects (e.g., [3,25]). Ensuring the correctness and atomicity of operations that span partitions is complex and potentially quite expensive, especially in an asynchronous, Byzantine fault-tolerant manner.…”

Section: Throughput-scalabilitymentioning

confidence: 99%

See 1 more Smart Citation

Fault-scalable Byzantine fault-tolerant services

Abd-El-Malek

Ganger

Goodson³

et al. 2005

Proceedings of the Twentieth ACM Symposium on Operating Systems Principles

192

283

View full text Add to dashboard Cite

A fault-scalable service can be configured to tolerate increasing numbers of faults without significant decreases in performance. The Query/Update (Q/U) protocol is a new tool that enables construction of fault-scalable Byzantine faulttolerant services. The optimistic quorum-based nature of the Q/U protocol allows it to provide better throughput and fault-scalability than replicated state machines using agreement-based protocols. A prototype service built using the Q/U protocol outperforms the same service built using a popular replicated state machine implementation at all system sizes in experiments that permit an optimistic execution. Moreover, the performance of the Q/U protocol decreases by only 36% as the number of Byzantine faults tolerated increases from one to five, whereas the performance of the replicated state machine decreases by 83%.

show abstract

Section: Throughput-scalabilitymentioning

confidence: 99%

Section: Throughput-scalabilitymentioning

confidence: 99%

Fault-scalable Byzantine fault-tolerant services

Abd-El-Malek

Ganger

Goodson³

et al. 2005

Proceedings of the Twentieth ACM Symposium on Operating Systems Principles

192

283

View full text Add to dashboard Cite

show abstract

“…They suggest the use of symmetric replication [19] to achieve availability. Instead of using RSMs inside cells, encoding schemes like Reed-Solomon codes could be used, as proposed by Litwin et al [20] to ensure proper availability.…”

Section: Related Workmentioning

confidence: 99%

Transactions for Distributed Wikis on Structured Overlays

Plantikow

Reinefeld

Schintke

2007

Managing Virtualization of Networks and Services

View full text Add to dashboard Cite

Abstract. We present a transaction processing scheme for structured overlay networks and use it to develop a distributed Wiki application based on a relational data model. The Wiki supports rich metadata and additional indexes for navigation purposes.Ensuring consistency and durability requires handling of node failures. We mask such failures by providing high availability of nodes by constructing the overlay from replicated state machines (cell model). Atomicity is realized using two phase commit with additional support for failure detection and restoration of the transaction manager. The developed transaction processing scheme provides the application with a mixture of pessimistic, hybrid optimistic and multiversioning concurrency control techniques to minimize the impact of replication on latency and optimize for read operations. We present pseudocode of the relevant Wiki functions and evaluate the different concurrency control techniques in terms of message complexity.

show abstract

“…Databases are distributed over a moderate number of fairly stable database servers and workstation clusters. Thus reliability is assumed to be high and replication is used only very selectively [24] for dealing with exceptional errors. Central servers for realizing certain coordination functions in the network are considered as acceptable and execution guarantees are mostly deterministic rather than probabilistic.…”

Section: Related Workmentioning

confidence: 99%

Multifaceted Simultaneous Load Balancing in DHT-Based P2P Systems: A New Game with Old Balls and Bins

Aberer

Datta

Hauswirth

2005

Self-Star Properties in Complex Information Systems

View full text Add to dashboard Cite

Abstract. This paper presents and evaluates uncoordinated on-line algorithms for simultaneous storage and replication load-balancing in DHTbased peer-to-peer systems. We compare our approach with the classical balls into bins model, and point out both the similarities as well as the differences which call for new load-balancing mechanisms specifically targeted at P2P systems. Some of the peculiarities of P2P systems, which make our problem challenging are that both the network membership and the data indexed in the network are dynamic, there is neither global coordination nor global information to rely on, and the load-balancing mechanism ideally should not compromise the structural properties and thus the search efficiency of the DHT, while preserving the semantic information of the data (e.g., lexicographic ordering to enable range searches).

show abstract

LH*s: a high-availability and high-security scalable distributed data structure

Cited by 13 publications

References 11 publications

Fault-scalable Byzantine fault-tolerant services

Fault-scalable Byzantine fault-tolerant services

Transactions for Distributed Wikis on Structured Overlays

Multifaceted Simultaneous Load Balancing in DHT-Based P2P Systems: A New Game with Old Balls and Bins

Contact Info

Product

Resources

About