aboutsummaryrefslogtreecommitdiffstats
path: root/src/swarm/topology.rs
Commit message (Collapse)AuthorAgeFilesLines
* introduce intended graphtv10 days1-0/+35
|
* topology: introduce outbound memberstv12 days1-0/+32
|
* list libp2p relays in documenttv12 days1-0/+1
|
* track unlisted memberstv12 days1-2/+28
|
* add support for renaming IDs in the loggertv12 days1-0/+14
|
* don't choose stale neighbours from member listtv13 days1-6/+23
|
* build topology per transporttv14 days1-4/+128
|
* add support for several transportstv14 days1-1/+7
|
* introduce addressestv14 days1-0/+1
|
* add smaller topology testtv2026-10-261-19/+35
|
* make clippy happy againtv2026-10-261-4/+4
|
* compute member pair scores cheaplytv2026-10-261-22/+65
|
* unreachability doesn't expiretv2026-10-261-5/+2
|
* send bounded peer liststv2026-10-261-1/+7
|
* unify lock logictv2026-10-261-17/+6
|
* add random swarms testtv2026-10-251-0/+62
|
* recompute neighbours whenever topology changestv2026-10-251-0/+20
|
* bound stable-hub degreetv2026-10-241-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 statstv2026-10-241-0/+38
|
* nodes prefer stable neighbourstv2026-10-241-10/+89
|
* pull missing changestv2026-10-241-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 neighbourstv2026-10-241-55/+130
|
* sync with neighbourstv2026-10-241-0/+91
|
* add neighbour graphtv2026-10-241-0/+179