aboutsummaryrefslogtreecommitdiffstats
path: root/src/swarm/relay.rs
Commit message (Collapse)AuthorAgeFilesLines
* relay: a STATUS's heads wait at least 50 ms before they are pulledtv4 days1-6/+10
| | | | | | | | | | | | | | A neighbour pulls heads a STATUS listed only if it still lacks them after a round trip to the sender, as they are usually on their way along a writer's tree. With no round trip known, or one measured long ago (busy pairs send no keepalives), it pulled at once; with a short one, a STATUS sent right after a change can overtake it by more than that round trip, delays varying per message. Either way the change came twice (`trees_hold_through_continuous_writes`: c pulled once while every write reached it along x's tree). The wait is the round trip, but 50 ms at least (and 1 s at most, as before).
* HyParView (slim)tv11 days1-2/+2
|
* plumtreetv11 days1-8/+13
|
* dissemination traittv11 days1-1/+5
|
* one grace wait per peertv11 days1-13/+17
|
* announce only to those behindtv12 days1-12/+28
|
* covered neighbours have ittv12 days1-4/+10
|
* slow round back offtv13 days1-5/+81
|
* tree messages need no answertv13 days1-1/+8
|
* unanswered pull frees the slottv13 days1-1/+22
| | | | | | When the answer to a pull is overdue (the sync reply timeout: 1 s in the simtests, 10 s in production), the pull gives up the slot, and the next waiting neighbour is pulled at once.
* pull after gracetv13 days1-3/+32
| | | | | | | | Before pulling, a node waits one measured round trip to the announcer (1 s at most) and pulls only what is still missing. If the round trip isn't known yet, it pulls at once, as now. On the clean benchmark links the round trip is a few milliseconds, so those scenarios shouldn't change.
* announcements answered when lackingtv13 days1-1/+7
| | | | | | | A neighbour now answers an announcement only if it lacks some of the announced heads. Heads that merely differ are no longer enough, since they do while writes go on. The check reads the document, so it runs off the message consumer, as the pull check already does.
* writers from authorstv2026-11-031-16/+19
|
* announcement round counterstv2026-11-031-6/+8
|
* docs after treestv2026-11-031-5/+6
|
* announce what trees misstv2026-11-031-15/+62
|
* replace eager links by treestv2026-11-031-81/+16
|
* add writer treestv2026-11-031-20/+36
|
* measure 2-hop neighbourhoodtv2026-11-031-3/+3
|
* add eager link counterstv2026-11-031-0/+3
|
* introduce eager linkstv2026-11-031-13/+79
|
* skip neighbours with our headstv2026-11-031-15/+36
|
* announcements answered only if heads differtv2026-11-031-5/+6
|
* always announce new headstv2026-11-031-34/+8
|
* swarm: announce to whom writers can't reachtv2026-11-021-10/+46
|
* use Automerge as Document instead of AutoCommittv2026-10-311-2/+2
| | | | This allows a lot of operations to drop mut.
* move all automerge references to documenttv2026-10-311-9/+2
|
* rename AutoMerge to Documenttv2026-10-311-1/+1
|
* unify request_sync logictv2026-10-311-4/+1
|
* rename PING/PONG to STATUS/STATUS_REPLYtv2026-10-281-6/+6
|
* talk about "transport" unless mycelium is meanttv2026-10-271-1/+1
|
* make clippy happy againtv2026-10-261-1/+1
|
* add sync and relay statstv2026-10-261-1/+9
|
* keepalive sends head samples alongside digesttv2026-10-261-21/+22
| | | | | | When there are more than 32 heads that can be send in a single keepalive message, the digest is accompanied by 32 heads, a different window each time, so after a few keepalives every head has been listed.
* add pull queuetv2026-10-261-31/+79
|
* read stamps sync and lock freetv2026-10-261-2/+3
|
* SyncSessions owns Automerge's sync statetv2026-10-261-2/+1
|
* unify lock logictv2026-10-261-14/+5
|
* coalesce announcementstv2026-10-241-2/+56
|
* cache headstv2026-10-241-0/+4
| | | | To reduce the number of write locks, heads are now cached.
* record RTT from keepalive messagestv2026-10-241-8/+3
|
* pull missing changestv2026-10-241-0/+126
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.