Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

Josh Olsen

dblp:41/6659 · DBLP profile ↗
← Back
2ranked-venue papers
0as first author
0since 2021 · last 2010
—ORCID · none

Domains — the database's venue-derived domains; a paper can count in several

Security and privacy · 2Systems, architecture and hardware · 1

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Computer architecture, parallel and distributed computing, and storage systems
1 paper
Distributed systems · 100%

Topics — the 3 heaviest of 3, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Distributed systems › fault tolerance
byzantine fault tolerance
0.112010
Steward: Scaling Byzantine Fault-Tolerant Replication to Wide Area Networks · IEEE Trans. Dependable Secur. Comput. 2010
Distributed systems
fault tolerance
0.112010
Steward: Scaling Byzantine Fault-Tolerant Replication to Wide Area Networks · IEEE Trans. Dependable Secur. Comput. 2010
Distributed systems › replication › geo-replication
wide-area replication
0.012010
Steward: Scaling Byzantine Fault-Tolerant Replication to Wide Area Networks · IEEE Trans. Dependable Secur. Comput. 2010

Methods — techniques the papers use, named apart from their topics

prototype implementation · 0.1
YearPublicationVenuePosition
2010 Steward: Scaling Byzantine Fault-Tolerant Replication to Wide Area Networks
abstract
This paper presents the first hierarchical byzantine fault-tolerant replication architecture suitable to systems that span multiple wide-area sites. The architecture confines the effects of any malicious replica to its local site, reduces message complexity of wide-area communication, and allows read-only queries to be performed locally within a site for the price of additional standard hardware. We present proofs that our algorithm provides safety and liveness properties. A prototype implementation is evaluated over several network topologies and is compared with a flat byzantine fault-tolerant approach. The experimental results show considerable improvement over flat byzantine replication algorithms, bringing the performance of byzantine replication closer to existing benign fault-tolerant replication techniques over wide area networks.
Yair Amir, Claudiu Danilov 0001, Danny Dolev, Jonathan Kirsch, John Lane, Cristina Nita-Rotaru, Josh Olsen, David Zage
IEEE Trans. Dependable Secur. Comput.7
2006 Scaling Byzantine Fault-Tolerant Replication toWide Area Networks
abstract
This paper presents the first hierarchical Byzantine fault-tolerant replication architecture suitable to systems that span multiple wide area sites. The architecture confines the effects of any malicious replica to its local site, reduces message complexity of wide area communication, and allows read-only queries to be performed locally within a site for the price of additional hardware. A prototype implementation is evaluated over several network topologies and is compared with a flat Byzantine fault-tolerant approach
Yair Amir, Claudiu Danilov 0001, Jonathan Kirsch, John Lane, Danny Dolev, Cristina Nita-Rotaru, Josh Olsen, David Zage
DSN7