Add link - Wikipedia: Hill Climbing

This commit is contained in:
slumlord
2018-04-09 12:12:27 +00:00
parent e3f5bdff19
commit 756476d421

View File

@@ -282,17 +282,17 @@ while they currently use fairly simple algorithms, alternatives exist.
{%- endtrans %}</p>
<p>{% trans -%}
Using this profile data, the simplest reasonable peer selection strategy
is to pick peers randomly from the top tier (fast and high capacity), and
this is currently deployed for client tunnels. Exploratory tunnels (used for
netDb and tunnel management) pick peers randomly from the "not failing" tier
(which includes routers in 'better' tiers as well), allowing the peer to sample
routers more widely, in effect optimizing the peer selection through randomized
hill climbing. These strategies alone do however leak information regarding
the peers in the router's top tier through predecessor and netDb harvesting
attacks. In turn, several alternatives exist which, while not balancing the
load as evenly, will address the attacks mounted by particular classes of
adversaries.
Using this profile data, the simplest reasonable peer selection strategy is to
pick peers randomly from the top tier (fast and high capacity), and this is
currently deployed for client tunnels. Exploratory tunnels (used for netDb and
tunnel management) pick peers randomly from the "not failing" tier (which
includes routers in 'better' tiers as well), allowing the peer to sample
routers more widely, in effect optimizing the peer selection through randomized
<a href="https://en.wikipedia.org/wiki/Hill_climbing">hill climbing</a>. These
strategies alone do however leak information regarding the peers in the
router's top tier through predecessor and netDb harvesting attacks. In turn,
several alternatives exist which, while not balancing the load as evenly, will
address the attacks mounted by particular classes of adversaries.
{%- endtrans %}</p>
<p>{% trans -%}