aboutsummaryrefslogtreecommitdiffstats
path: root/src/swarm
Commit message (Collapse)AuthorAgeFilesLines
* one delta at a timetv4 days2-9/+53
|
* time blob messagestv4 days4-4/+46
|
* log why a deltatv4 days1-0/+6
|
* offered deltas lapsetv4 days1-4/+14
|
* throughput from delivered messagetv4 days2-2/+59
|
* hop delaystv4 days4-2/+128
|
* benchmark delays by pathtv4 days2-0/+15
|
* fix: change publisher stops with the runtimetv4 days1-3/+8
|
* benchmark what sync bytes aretv4 days2-3/+30
|
* changes from a peer never go backtv4 days1-0/+4
|
* older delivered messages leave us leveltv4 days1-1/+3
|
* benchmark where twice comes fromtv4 days2-4/+11
|
* resend only what is neededtv4 days1-1/+1
|
* benchmark delivered and twicetv4 days2-0/+30
|
* any message taken as deliveredtv4 days2-13/+23
|
* slow round back offtv4 days2-5/+86
|
* tree messages need no answertv4 days3-6/+40
|
* hello again when heard fromtv4 days2-2/+19
| | | | | | While we wait for a peer's HELLO_REPLY, anything else that comes from it makes our HELLO go again at once, at most once a second, instead of when the backoff says.
* unanswered pull frees the slottv4 days2-1/+23
| | | | | | 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.
* overdue sync asked after from thentv4 days2-4/+4
|
* pull after gracetv4 days2-4/+33
| | | | | | | | 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 lackingtv4 days4-10/+34
| | | | | | | 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.
* unanswered members not reachedtv5 days2-14/+43
|
* links: only news pass ontv5 days1-6/+12
|
* dashboard: show writer treestv5 days1-26/+70
|
* writers from authorstv5 days3-27/+46
|
* reach set for the sessiontv5 days2-16/+10
|
* tree changes had alreadytv5 days1-4/+14
|
* announcement round counterstv5 days2-8/+23
|
* docs after treestv5 days1-5/+6
|
* announce what trees misstv5 days2-35/+115
|
* order members by distancetv5 days2-26/+59
|
* replace eager links by treestv5 days6-137/+35
|
* add writer treestv5 days5-27/+266
|
* add writer tree benchmarktv5 days1-0/+148
|
* measure 2-hop neighbourhoodtv5 days7-8/+136
|
* dashboard: show eager links on the maptv6 days1-5/+19
|
* add eager link counterstv6 days2-0/+21
|
* introduce eager linkstv6 days3-21/+100
|
* skip neighbours with our headstv6 days2-15/+37
|
* announcements answered only if heads differtv6 days4-7/+30
|
* retry new peers before probingtv6 days1-1/+1
|
* probe list memberstv6 days3-6/+17
|
* links: add failovertv6 days1-14/+129
|
* swarm: links by whom we reachtv6 days2-12/+25
|
* always announce new headstv6 days2-45/+9
|
* links: when asking for a lot relays, do chunktv6 days1-17/+72
|
* add budget for relayed LINKStv6 days1-1/+29
|
* add links relay testtv6 days1-0/+33
|
* swarm: relay links messagestv6 days2-24/+434
|