| Commit message (Collapse) | Author | Age | Files | Lines | |
|---|---|---|---|---|---|
| * | build topology per transport | tv | 8 days | 1 | -4/+128 |
| | | |||||
| * | add support for several transports | tv | 8 days | 1 | -1/+7 |
| | | |||||
| * | introduce addresses | tv | 8 days | 1 | -0/+1 |
| | | |||||
| * | add smaller topology test | tv | 8 days | 1 | -19/+35 |
| | | |||||
| * | make clippy happy again | tv | 9 days | 1 | -4/+4 |
| | | |||||
| * | compute member pair scores cheaply | tv | 9 days | 1 | -22/+65 |
| | | |||||
| * | unreachability doesn't expire | tv | 9 days | 1 | -5/+2 |
| | | |||||
| * | send bounded peer lists | tv | 9 days | 1 | -1/+7 |
| | | |||||
| * | unify lock logic | tv | 9 days | 1 | -17/+6 |
| | | |||||
| * | add random swarms test | tv | 9 days | 1 | -0/+62 |
| | | |||||
| * | recompute neighbours whenever topology changes | tv | 10 days | 1 | -0/+20 |
| | | |||||
| * | bound stable-hub degree | tv | 11 days | 1 | -4/+46 |
| | | | | | | | Each stable member can be preferred at most by 4*k members. The budget is spent in key order, which is the same on every node, so the graph stays deterministic, symmetric and connected. | ||||
| * | add swarm stats | tv | 11 days | 1 | -0/+38 |
| | | |||||
| * | nodes prefer stable neighbours | tv | 11 days | 1 | -10/+89 |
| | | |||||
| * | pull missing changes | tv | 11 days | 1 | -0/+17 |
| | | | | | | | Nodes push changes to their neighbours but don't relay them directly. In a partial mesh, nodes can learn about missing changes via keepalive messages and can pull them from their neighbours. | ||||
| * | find reachable neighbours | tv | 11 days | 1 | -55/+130 |
| | | |||||
| * | sync with neighbours | tv | 11 days | 1 | -0/+91 |
| | | |||||
| * | add neighbour graph | tv | 11 days | 1 | -0/+179 |
 |
index : continuum | |
| P2P replicated document storage service |
| aboutsummaryrefslogtreecommitdiffstats |