Crate openraft

source ·
Expand description

Openraft

Advanced Raft in 🦀 Rust using Tokio. Please ⭐ on github!

Crates.io docs.rs guides
CI License Crates.io Crates.io

🪵🪵🪵 Raft is not yet good enough. This project intends to improve raft as the next-generation consensus protocol for distributed data storage systems (SQL, NoSQL, KV, Streaming, Graph … or maybe something more exotic).

Currently, openraft is the consensus engine of meta-service cluster in databend.

Status

  • Openraft API is not stable yet. Before 1.0.0, an upgrade may contain incompatible changes. Check our change-log. A commit message starts with a keyword to indicate the modification type of the commit:

    • DataChange: on-disk data types changes, which may require manual upgrade.
    • Change: if it introduces incompatible changes.
    • Feature: if it introduces compatible non-breaking new features.
    • Fix: if it just fixes a bug.
  • Branch main has been under active development.

    The main branch is for the 0.8 release.

    • The features are almost complete for building an application.
    • The performance isn’t yet fully optimized. Currently, it’s about 48,000 writes per second with a single writer.
    • Unit test coverage is 91%.
    • The chaos test is not yet done.
  • Branch release-0.8: Latest published: v0.8.1 | Change log v0.8.1 | ⬆️ 0.7 to 0.8 upgrade guide |

  • Branch release-0.7: Latest published: v0.7.4 | Change log v0.7.4 | ⬆️ 0.6 to 0.7 upgrade guide | release-0.7 Won’t accept new features but only bug fixes.

  • Branch release-0.6: Latest published: v0.6.8 | Change log v0.6 | release-0.6 won’t accept new features but only bug fixes.

Roadmap

  • 2022-10-31 Extended joint membership

  • 2023-02-14 Minimize confliction rate when electing; See: Openraft Vote design; Or use standard raft mode with feature flag single-term-leader.

  • Reduce the complexity of vote and pre-vote: get rid of pre-vote RPC;

  • Support flexible quorum, e.g.:Hierarchical Quorums

  • Consider introducing read-quorum and write-quorum, improve efficiency with a cluster with an even number of nodes.

  • Goal performance is 1,000,000 put/sec.

    Bench history:

    • 2022 Jul 01: 41,000 put/sec; 23,255 ns/op;
    • 2022 Jul 07: 43,000 put/sec; 23,218 ns/op; Use Progress to track replication.
    • 2022 Jul 09: 45,000 put/sec; 21,784 ns/op; Batch purge applied log
    • 2023 Feb 28: 48,000 put/sec; 20,558 ns/op;

    Run the benchmark: make bench_cluster_of_3

    Benchmark setting:

    • No network.
    • In memory store.
    • A cluster of 3 nodes on one server.
    • Single client.

Features

  • It is fully reactive and embraces the async ecosystem. It is driven by actual Raft events taking place in the system as opposed to being driven by a tick operation. Batching of messages during replication is still used whenever possible for maximum throughput.

  • Storage and network integration is well defined via two traits RaftStorage & RaftNetwork. This provides applications maximum flexibility in being able to choose their storage and networking mediums.

  • All interaction with the Raft node is well defined via a single public Raft type, which is used to spawn the Raft async task, and to interact with that task. The API for this system is clear and concise.

  • Log replication is fully pipelined and batched for optimal performance. Log replication also uses a congestion control mechanism to help keep nodes up-to-date as efficiently as possible.

  • It fully supports dynamic cluster membership changes with joint config. The buggy single-step membership change algo is not considered. See the dynamic membership chapter in the guide.

  • Details on initial cluster formation, and how to effectively do so from an application’s perspective, are discussed in the cluster formation chapter in the guide.

  • Automatic log compaction with snapshots, as well as snapshot streaming from the leader node to follower nodes is fully supported and configurable.

  • The entire code base is instrumented with tracing. This can be used for standard logging, or for distributed tracing, and the verbosity can be statically configured at compile time to completely remove all instrumentation below the configured level.

Who use it

Contributing

Check out the CONTRIBUTING.md guide for more details on getting started with contributing to this project.

License

Openraft is licensed under the terms of the MIT License or the Apache License 2.0, at your choosing.

Feature flags

  • bench: Enables benchmarks in unittest. Benchmark in openraft depends on the unstable feature test thus it can not be used with stable rust. In order to run the benchmark with stable toolchain, the unstable features have to be enabled explicitly with environment variable RUSTC_BOOTSTRAP=1.

  • bt: Enable backtrace: generate backtrace for errors. This requires unstable feature error_generic_member_access and provide_any thus it can not be used with stable rust.

  • serde: Add serde::Serialize and serde:Deserialize bound to data types. If you’d like to use serde to serialize messages.

Re-exports

Modules

Macros

Structs

  • AnyError is a serializable wrapper Error.
  • Minimal node information.
  • The runtime configuration for a Raft node.
  • An error that occurs when the RaftStore impl runs defensive check of input or output. E.g. re-applying an log entry is a violation that may be a potential bug.
  • The currently active membership config.
  • Empty Node.
  • A Raft log entry.
  • LeaderId is identifier of a leader.
  • The identity of a raft log. A term, node_id and an index identifies an log globally.
  • The membership configuration of the cluster.
  • The state of membership configs a raft node needs to know.
  • A struct used to represent the raft state which a Raft node needs.
  • The identity of a segment of a snapshot.
  • Error that occurs when operating the store.
  • Extended store backed by another impl.
  • This struct represents information about a membership config that has already been stored in the raft logs.
  • Vote represent the privilege of a node.

Enums

Traits

Type Definitions