Global ETD Search

Search theses and dissertations gathered from participating repositories worldwide. Every result links back to the library that holds it. No account is needed.

Results

Showing 1 to 20 of 33 for “"State Machine Replication"”.

  1. Scalable state machine replication

    … a replicated service is by using techniques like state machine replication (SMR). SMR provides fault tolerance, while being linearizable, that is, clients cannot distinguish the behaviour of the replicated system to that of a single-site, unreplicated one. However, having a fully replicated, …

    brazil-ufrgs Repository record for Scalable state machine replication (opens in a new tab)

  2. Self-Stabilizing Emulation of State-Machine Replication: Implementation and Evaluation of Self-Stabilizing Emulation of State-Machine Replication with Global Restart Mechanism

    … the service of a self-stabilizing emulation of state-machine replication. The project demonstrates that recent advancements in the area of selfstabilization can provide real-world distributed systems with a higher degree of fault-tolerance.

    chalmers Repository record for Self-Stabilizing Emulation of State-Machine Replication: Implementation and Evaluation of Self-Stabilizing Emulation of State-Machine Replication with Global Restart Mechanism (opens in a new tab)

  3. Scalable Byzantine State Machine Replication: Designs, Techniques, and Implementations

    State machine replication (SMR) is one of the most widely studied and used methodology for building highly available distributed applications and services. SMR replicates a service across a set of computing hosts, and executes client operations on the replicas in an agreed- upon total order, …

    vt Repository record for Scalable Byzantine State Machine Replication: Designs, Techniques, and Implementations (opens in a new tab)

  4. Self-Stabilizing Byzantine Fault-Tolerant State Machine Replication - Rust Implementation, Experimental Evaluation and Applications in Trucks

    … systems. To bring reliability to these services, State Machine Replication (SMR) is one possibility. This thesis focuses on the performance evaluation of the SMR algorithm by Dolev et al.. Specifically, our evaluation criterion considers latency, which is the time from when a client issues a …

    chalmers Repository record for Self-Stabilizing Byzantine Fault-Tolerant State Machine Replication - Rust Implementation, Experimental Evaluation and Applications in Trucks (opens in a new tab)

  5. Implementing Self-stabilizing Byzantine Fault-tolerant State-machine Replication: a Proof of Concept, Validation and Preliminary Evaluation

    … on these services, which can be achieved using state machine replication. This project covers the implementation of proof-of-concept, validation and preliminary evaluation of the Self-Stabilizing Byzantine Tolerant Replicated State Machine Based on Failure Detectors algorithm presented by Dolev, …

    chalmers Repository record for Implementing Self-stabilizing Byzantine Fault-tolerant State-machine Replication: a Proof of Concept, Validation and Preliminary Evaluation (opens in a new tab)

  6. xBFT : Byzantine fault tolerance with high performance, low cost, and aggressive fault isolation

    … in practical systems, Byzantine fault tolerant state machine replication technique is becoming increasingly attractive for building highlyreliable services in order to tolerate such failures. However, existing Byzantine fault tolerant techniques fall short of providing high availability, high …

    texas Repository record for xBFT : Byzantine fault tolerance with high performance, low cost, and aggressive fault isolation (opens in a new tab)

  7. Byzantine fault-tolerance and beyond

    … fault-tolerance for both quorum systems and state machine replication. Our contributions include proving new lower bounds, finding new protocols that meet these bounds, and providing new functionality at lower cost through a new architecture for state machine replication. The second part of …

    texas Repository record for Byzantine fault-tolerance and beyond (opens in a new tab)

  8. Ordering versus Bounded Delay: Timely Consensus

    … to design high-performance consensus and state machine replication protocols by enabling a stronger communication model, one where the network provides message ordering. This thesis explores a very different communication model that can be enabled by datacenter networks---bounded message …

    cornell Repository record for Ordering versus Bounded Delay: Timely Consensus (opens in a new tab)

  9. RDMA-Accelerated State Machine for Cloud Services

    … optimal support for systems that employ data or state machine replication for strong consistency. Such systems are common and vital in the cloud, and state machine replication is a building block for stronger higher level guarantees such as the ones commonly sought in database applications. …

    cornell Repository record for RDMA-Accelerated State Machine for Cloud Services (opens in a new tab)

  10. Parsimonious Service Replication for Tolerating Malicious Attacks in Asynchronous Environments

    … kind of faults, namely Byzantine faults, through state machine replication in asynchronous environments such as the Internet. In Byzantine-fault-tolerant (BFT) state machine replication, state consistency among the replicas of a service is maintained by first agreeing on the order of requests to …

    uiuc Repository record for Parsimonious Service Replication for Tolerating Malicious Attacks in Asynchronous Environments (opens in a new tab)

  11. Replicating multithreaded services

    … results: the literature describes how to design replication protocols that tolerate a wide range of failures (from simple crashes to malicious "Byzantine" failures) in a wide range of settings (e.g. synchronous or asynchronous communication, with or without stable storage), optimizing various …

    texas Repository record for Replicating multithreaded services (opens in a new tab)

  12. UpRight fault tolerance

    … solution based on Byzantine fault tolerant (BFT) state machine replication is an efficient and deployable alternative to current ad hoc approaches favored in general purpose computing. The replicated state machine approach ensures that multiple copies of the same deterministic application execute …

    texas Repository record for UpRight fault tolerance (opens in a new tab)

  13. Performance Modeling & Analysis of Hyperledger Fabric (Permissioned Blockchain Network)

    … and v1.0+ (V1). HLF v0.6 follows a traditional state-machine replication architecture followed by many other blockchain platforms, whereas HLF V1 follows a novel execute-order-validate architecture. We parameterize and validate our models with data collected from a real-world Fabric network …

    duke Repository record for Performance Modeling & Analysis of Hyperledger Fabric (Permissioned Blockchain Network) (opens in a new tab)

  14. Co-Designing Distributed Systems with Programmable Network Hardware

    … virtually eliminate the coordination overhead in state machine replication and fault-tolerant distributed transactions, by relying on network sequencing primitives to consistently order user requests. The third, Pegasus, substantially improves the load balance of a distributed storage system. To …

    washington Repository record for Co-Designing Distributed Systems with Programmable Network Hardware (opens in a new tab)

  15. Proactive Obfuscation

    … two prototypes: a distributed firewall based on state-machine replication and a distributed storage service based on quorum systems. Costs intrinsic to supporting proactive obfuscation were quantified by measuring the performance of these prototypes. Authentication is a large cost in proactive …

    cornell Repository record for Proactive Obfuscation (opens in a new tab)

  16. Replication of Concurrent Applications in a Shared Memory Multikernel

    State Machine Replication (SMR) has become the de-facto methodology of building a replication based fault-tolerance system. Current SMR systems usually have multiple machines involved, each of the machines in the SMR system acts as the replica of others. However having multiple machines leads to …

    vt Repository record for Replication of Concurrent Applications in a Shared Memory Multikernel (opens in a new tab)

  17. A Scalable Leader Based Consensus Algorithm

    … of computing, redundancy is attained through state machine repli- cation. Protocols like Raft, Multi-Paxos, ZAB, or other variants of Paxos are commonly used to achieve state machine replication. These protocols choose one of the processes from multiple processes running on various machines in …

    vt Repository record for A Scalable Leader Based Consensus Algorithm (opens in a new tab)

  18. On the performance of Byzantine fault-tolerant consensus in the blockchain era

    … (BFT) consensus protocols to provide replication services that tolerate limited arbitrary behavior among participants. To support large-scale decentralized applications, a scalable and efficient design is the key. This dissertation studies the performance of BFT consensus in the …

    ubc Repository record for On the performance of Byzantine fault-tolerant consensus in the blockchain era (opens in a new tab) Download PDF for On the performance of Byzantine fault-tolerant consensus in the blockchain era (opens in a new tab)

  19. Improving Security and Privacy in Online Social Networks

    … we propose Fast Mencius, a crash-fault tolerant state machine replication protocol that has low latency and high throughput in wide-area networks. For the function layer of OSNs, we investigate how to prevent the functioning of OSNs from being disturbed by adversaries, and we propose …

    wm-mary Repository record for Improving Security and Privacy in Online Social Networks (opens in a new tab)

  20. Ordered Consensus with Equal Opportunity

    … total order of commands agreed upon when running state machine replication (SMR) is immaterial to fault tolerance: all that is required is for all correct nodes to follow the same order. In SMR-based blockchains, however, correct nodes should be responsible for being unbiased when choosing the …

    cornell Repository record for Ordered Consensus with Equal Opportunity (opens in a new tab)

Page 1 of 2