A crate for writing fast and highly resilient in-process gRPC service meshes.
blip provides an implementation of distributed membership based on rapid, exposed
as a gRPC service. Groups of servers become aware of each other through the membership
protocol, and any given member may expose its own metadata or linked services through
the same backing gRPC server.
In essence, this crate provides a membership list with strong consistency semantics (as opposed to weakly consistent protocols like SWIM), distributed fault detection, and grpc routing.
blip is designed to build heterogenous meshes. As such, members may expose arbitrary
(immutable) key-value metadata when they join a mesh, which can be used for the purpose
of service discovery.
blip does not enforce any invariants with regard to state held by members of a mesh.
For maximal flexibility, state and sharding are deferred to implementations of member
full: Enables all optional features.
cache: Enables the cache service.
A distributed membership protocol based closely on rapid.
Batteries-included grpc service mesh.
Ready-to-use mesh-aware services.
A cluster member.
An unstarted member of a blip mesh network.
An accepted view-change proposal. Cloning this is cheap, as membership information is stored as refcounted slices.
Rejoin the existing cluster through random healthy members.
A subscription to accepted view-change proposals.
A trait that allows individual services access to any accepted membership view-change proposals.
A re-export of async_trait for convenience.