rust distributed-systems algorithms
Distributed Mesh Optimizer
A Rust R&D prototype exploring low-latency, fault-tolerant coordination between edge nodes.
8-32
node topologies benchmarked
Actor-per-node
bounded-queue Tokio model
[ tbd ]
convergence ms — pending benchmark
[ role ] Sole engineer · R&D prototype
Project specs
Tech Stack
Rust Tokio gRPC Protobuf
R&D Focus
Consensus Algorithms
Complexity
An R&D prototype built to explore low-latency, fault-tolerant coordination between edge nodes.
Problem
In edge deployments, each node must make local decisions even when the network is unstable, while the cluster still converges on a single shared state.
Approach
- › Model nodes as actors with bounded message queues.
- › Keep consensus heartbeats lightweight using Rust and Tokio.
- › Encode node state changes over gRPC so both a simulator and a real service can share the same contract.
- › Track convergence window and message fan-out as primary metrics.
Next steps
- › Add deterministic simulation fixtures for packet loss and delayed acknowledgements.
- › Publish benchmark data for 8, 16, and 32-node topologies.
- › Extract the metrics layer into a reusable Rust crate.