eagler -> eagerer

This commit is contained in:
James Ray
2018-07-05 11:22:00 +10:00
committed by GitHub
parent 5d049e2baa
commit fc98b0c655

View File

@@ -69,7 +69,7 @@ pull missing messages. Initially, all peers in the active list are
eager forming a connected mesh. As messages propagate, peers _prune_
eager links when receiving duplicate messages, thus constructing a
multicast tree. The tree is repaired when peers receive lazy messages
that were not propagated via eager links by _grafting_ an eagler link
that were not propagated via eager links by _grafting_ an eagerer link
on top of a lazy one.
In steady state, the protocol optimizes the multicast tree in two