You can not select more than 25 topics Topics must start with a letter or number, can include dashes ('-') and can be up to 35 characters long.

164 lines
7.0 KiB

  1. # Peer Strategy and Exchange
  2. Here we outline the design of the AddressBook
  3. and how it used by the Peer Exchange Reactor (PEX) to ensure we are connected
  4. to good peers and to gossip peers to others.
  5. ## Peer Types
  6. Certain peers are special in that they are specified by the user as `persistent`,
  7. which means we auto-redial them if the connection fails, or if we fail to dial
  8. them.
  9. Some peers can be marked as `private`, which means
  10. we will not put them in the address book or gossip them to others.
  11. All peers except private peers and peers coming from them are tracked using the
  12. address book.
  13. The rest of our peers are only distinguished by being either
  14. inbound (they dialed our public address) or outbound (we dialed them).
  15. ## Discovery
  16. Peer discovery begins with a list of seeds.
  17. When we don't have enough peers, we
  18. 1. ask existing peers
  19. 2. dial seeds if we're not dialing anyone currently
  20. On startup, we will also immediately dial the given list of `persistent_peers`,
  21. and will attempt to maintain persistent connections with them. If the
  22. connections die, or we fail to dial, we will redial every 5s for a few minutes,
  23. then switch to an exponential backoff schedule, and after about a day of
  24. trying, stop dialing the peer. This behavior is when `persistent_peers_max_dial_period` is configured to zero.
  25. But If `persistent_peers_max_dial_period` is set greater than zero, terms between each dial to each persistent peer
  26. will not exceed `persistent_peers_max_dial_period` during exponential backoff.
  27. Therefore, `dial_period` = min(`persistent_peers_max_dial_period`, `exponential_backoff_dial_period`)
  28. and we keep trying again regardless of `maxAttemptsToDial`
  29. As long as we have less than `MaxNumOutboundPeers`, we periodically request
  30. additional peers from each of our own and try seeds.
  31. ## Listening
  32. Peers listen on a configurable ListenAddr that they self-report in their
  33. NodeInfo during handshakes with other peers. Peers accept up to
  34. `MaxNumInboundPeers` incoming peers.
  35. ## Address Book
  36. Peers are tracked via their ID (their PubKey.Address()).
  37. Peers are added to the address book from the PEX when they first connect to us or
  38. when we hear about them from other peers.
  39. The address book is arranged in sets of buckets, and distinguishes between
  40. vetted (old) and unvetted (new) peers. It keeps different sets of buckets for
  41. vetted and unvetted peers. Buckets provide randomization over peer selection.
  42. Peers are put in buckets according to their IP groups.
  43. IP group can be a masked IP (e.g. `1.2.0.0` or `2602:100::`) or `local` for
  44. local addresses or `unroutable` for unroutable addresses. The mask which
  45. corresponds to the `/16` subnet is used for IPv4, `/32` subnet - for IPv6.
  46. Each group has a limited number of buckets to prevent DoS attacks coming from
  47. that group (e.g. an attacker buying a `/16` block of IPs and launching a DoS
  48. attack).
  49. [highwayhash](https://arxiv.org/abs/1612.06257) is used as a hashing function
  50. when calculating a bucket.
  51. When placing a peer into a new bucket:
  52. ```md
  53. hash(key + sourcegroup + int64(hash(key + group + sourcegroup)) % bucket_per_group) % num_new_buckets
  54. ```
  55. When placing a peer into an old bucket:
  56. ```md
  57. hash(key + group + int64(hash(key + addr)) % buckets_per_group) % num_old_buckets
  58. ```
  59. where `key` - random 24 HEX string, `group` - IP group of the peer (e.g. `1.2.0.0`),
  60. `sourcegroup` - IP group of the sender (peer who sent us this address) (e.g. `174.11.0.0`),
  61. `addr` - string representation of the peer's address (e.g. `174.11.10.2:26656`).
  62. A vetted peer can only be in one bucket. An unvetted peer can be in multiple buckets, and
  63. each instance of the peer can have a different IP:PORT.
  64. If we're trying to add a new peer but there's no space in its bucket, we'll
  65. remove the worst peer from that bucket to make room.
  66. ## Vetting
  67. When a peer is first added, it is unvetted.
  68. Marking a peer as vetted is outside the scope of the `p2p` package.
  69. For Tendermint, a Peer becomes vetted once it has contributed sufficiently
  70. at the consensus layer; ie. once it has sent us valid and not-yet-known
  71. votes and/or block parts for `NumBlocksForVetted` blocks.
  72. Other users of the p2p package can determine their own conditions for when a peer is marked vetted.
  73. If a peer becomes vetted but there are already too many vetted peers,
  74. a randomly selected one of the vetted peers becomes unvetted.
  75. If a peer becomes unvetted (either a new peer, or one that was previously vetted),
  76. a randomly selected one of the unvetted peers is removed from the address book.
  77. More fine-grained tracking of peer behaviour can be done using
  78. a trust metric (see below), but it's best to start with something simple.
  79. ## Select Peers to Dial
  80. When we need more peers, we pick addresses randomly from the addrbook with some
  81. configurable bias for unvetted peers. The bias should be lower when we have
  82. fewer peers and can increase as we obtain more, ensuring that our first peers
  83. are more trustworthy, but always giving us the chance to discover new good
  84. peers.
  85. We track the last time we dialed a peer and the number of unsuccessful attempts
  86. we've made. If too many attempts are made, we mark the peer as bad.
  87. Connection attempts are made with exponential backoff (plus jitter). Because
  88. the selection process happens every `ensurePeersPeriod`, we might not end up
  89. dialing a peer for much longer than the backoff duration.
  90. If we fail to connect to the peer after 16 tries (with exponential backoff), we
  91. remove from address book completely. But for persistent peers, we indefinitely try to
  92. dial all persistent peers unless `persistent_peers_max_dial_period` is configured to zero
  93. ## Select Peers to Exchange
  94. When we’re asked for peers, we select them as follows:
  95. - select at most `maxGetSelection` peers
  96. - try to select at least `minGetSelection` peers - if we have less than that, select them all.
  97. - select a random, unbiased `getSelectionPercent` of the peers
  98. Send the selected peers. Note we select peers for sending without bias for vetted/unvetted.
  99. ## Preventing Spam
  100. There are various cases where we decide a peer has misbehaved and we disconnect from them.
  101. When this happens, the peer is removed from the address book and black listed for
  102. some amount of time. We call this "Disconnect and Mark".
  103. Note that the bad behaviour may be detected outside the PEX reactor itself
  104. (for instance, in the mconnection, or another reactor), but it must be communicated to the PEX reactor
  105. so it can remove and mark the peer.
  106. In the PEX, if a peer sends us an unsolicited list of peers,
  107. or if the peer sends a request too soon after another one,
  108. we Disconnect and MarkBad.
  109. ## Trust Metric
  110. The quality of peers can be tracked in more fine-grained detail using a
  111. Proportional-Integral-Derivative (PID) controller that incorporates
  112. current, past, and rate-of-change data to inform peer quality.
  113. While a PID trust metric has been implemented, it remains for future work
  114. to use it in the PEX.
  115. See the [trustmetric](https://github.com/tendermint/tendermint/blob/master/docs/architecture/adr-006-trust-metric.md)
  116. and [trustmetric useage](https://github.com/tendermint/tendermint/blob/master/docs/architecture/adr-007-trust-metric-usage.md)
  117. architecture docs for more details.