aboutsummaryrefslogtreecommitdiffstats
path: root/docs
diff options
context:
space:
mode:
Diffstat (limited to 'docs')
-rw-r--r--docs/topology.md5
1 files changed, 4 insertions, 1 deletions
diff --git a/docs/topology.md b/docs/topology.md
index 674eaed..1781157 100644
--- a/docs/topology.md
+++ b/docs/topology.md
@@ -32,7 +32,10 @@ can compute every other node's neighbours, writers' trees can be built on it.
agreed to be one (NEIGHBOUR, NEIGHBOUR_REPLY, DISCONNECT), about `k` of them (5 unless
`--neighbours` is set, the paper's size for up to about 10 000 members). Members that
fail leave it, and others are asked; each neighbour is asked again every minute whether
-it still is, so a link lost at one end (a lost DISCONNECT) doesn't stay at the other. The passive view, whom to ask, is drawn from the
+it still is, so a link lost at one end (a lost DISCONNECT) doesn't stay at the other. A
+member one neighbour short says so when it asks, and one with `k` takes it as its
+`k + 1`th: a few members one short, neighbours of each other, would otherwise ask only
+full members and stay an island. The passive view, whom to ask, is drawn from the
member list, not from the paper's JOIN and SHUFFLE (`swarm::hyparview`). There is no
graph every node shares: writers' trees, recorded links, indirect probes and the
dashboard's intended links do nothing.