commit ef1c2f2c8dda3d39026241e967ea0a48d055bf82 parent 28cea67fa6089ec0b9ba33d7aeef57664516eba9 Author: Martin Schanzenbach <schanzen@gnunet.org> Date: Mon, 23 May 2022 17:40:14 +0200 minor Diffstat:
| M | draft-schanzen-r5n.xml | | | 3 | +-- |
1 file changed, 1 insertion(+), 2 deletions(-)
diff --git a/draft-schanzen-r5n.xml b/draft-schanzen-r5n.xml @@ -813,8 +813,7 @@ bchar = *(ALPHA / DIGIT) <t> The routing table consists of an array of k-buckets. Each k-bucket contains a list of neighbors. - The i-th k-bucket stores neighbors whose - identifiers are between distance 2^i and 2^(i+1) from the local peer. + The i-th k-bucket stores neighbors whose peer IDs are between distance 2^i and 2^(i+1) from the local peer. System constraints will typically force an implementation to impose some upper limit on the number of neighbors kept per k-bucket. </t>