Each node owns a slice of the token ring and a replica of its neighbour's slice. Losing one node costs latency, not data.
| Node | Uptime | Memory | Conns | Repl lag | Evictions/min |
|---|---|---|---|---|---|
| eu-a1 | 47d | 171 / 192 GB | 2 140 | 0 ms | 1 820 |
| eu-a2 | 47d | 164 / 192 GB | 2 006 | 2 ms | 1 640 |
| eu-a3 | 47d | 159 / 192 GB | 1 954 | 1 ms | 1 588 |
| eu-b1 | 2h | 118 / 192 GB | 1 102 | 340 ms | 2 470 |
lost node keeps its
tokens until an operator releases them, so a flapping link does not reshuffle the ring.Clients hold one long-lived connection per node and multiplex every request over it. A pool of 2 000 connections on a node means roughly 2 000 client processes, not 2 000 concurrent requests — concurrency lives inside the connection.