aboutsummaryrefslogtreecommitdiffstats
path: root/docs/peers.md
Commit message (Collapse)AuthorAgeFilesLines
* pull after gracetv4 days1-1/+3
| | | | | | | | 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 days1-2/+3
| | | | | | | 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 days1-5/+10
|
* writers from authorstv5 days1-5/+7
|
* reach set for the sessiontv5 days1-2/+4
|
* tree changes had alreadytv5 days1-1/+3
|
* announce what trees misstv5 days1-1/+6
|
* order members by distancetv5 days1-4/+6
|
* replace eager links by treestv5 days1-9/+2
|
* add writer treestv5 days1-0/+16
|
* measure 2-hop neighbourhoodtv5 days1-0/+9
|
* introduce eager linkstv5 days1-1/+9
|
* skip neighbours with our headstv5 days1-1/+4
|
* announcements answered only if heads differtv5 days1-2/+3
|
* retry new peers before probingtv5 days1-1/+3
|
* probe list memberstv5 days1-1/+3
|
* always announce new headstv5 days1-5/+4
|
* swarm: announce to whom writers can't reachtv5 days1-1/+4
|
* add documentationtv6 days1-0/+358