cwinfo/yggdrasil-network.github.io
5
0
Fork 0
mirror of https://github.com/cwinfo/yggdrasil-network.github.io.git synced 2025-02-28 23:21:34 +00:00
Code Releases Activity

Couple of spelling corrections

Browse Source
This commit is contained in:
Neil Alexander 2018-12-11 16:28:33 +00:00
parent 2d90cf63df
commit 7f7a3004fa
No known key found for this signature in database
GPG Key ID: A02A2019A2BB0944
1 changed files with 20 additions and 20 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

40
_posts/2018-12-12-announcing-v0-3.md
View File

@ -13,10 +13,10 @@ encrypted and scalable compact routing scheme modelled around the concept of a
global spanning tree. Many concept routing schemes that we have seen to date global spanning tree. Many concept routing schemes that we have seen to date
seem to have problems with scalability - after the network exceeds a certain seem to have problems with scalability - after the network exceeds a certain
size, they either fail to perform or they start to rely on centralised points in size, they either fail to perform or they start to rely on centralised points in
order to consolidate routing information. We want to figure out how to build something that order to consolidate routing information. We want to figure out how to build
would not be subject to these limitations, and to maintain decentralisation as something that would not be subject to these limitations, and to maintain
far as possible, and the best way to test our ideas is to build that network. decentralisation as far as possible, and the best way to test our ideas is to
To our knowledge, this hasn't quite been achieved before. build that network. To our knowledge, this hasn't quite been achieved before.
Throughout the course of 2018, Yggdrasil has gone from being a very early-stage Throughout the course of 2018, Yggdrasil has gone from being a very early-stage
project supporting only a single platform to a feature-strong and relatively project supporting only a single platform to a feature-strong and relatively
@ -73,25 +73,25 @@ beginning of November about CKR, which explains some more about how to configure
it and how it works. it and how it works.
In the background, we've made a substantial change from using a Kademlia-based In the background, we've made a substantial change from using a Kademlia-based
DHT to a Chord-based DHT. The chord-based appraoch allows us to do lookups with DHT to a Chord-based DHT. The Chord-based approach allows us to do lookups with
`O(1)` (constant) state, and only depends on additional (`O(logn)`) state as a `O(1)` (constant) state, and only depends on additional (`O(logn)`) state as a
performance optimization, which allows us to bootstrap more quickly after changes. performance optimisation, which allows us to bootstrap more quickly after
We also believe that using Chord can help us to reduce some idle DHT chatter changes. We also believe that using Chord can help us to reduce some idle DHT
on the network in the future, which will save a little bandwidth, and may be chatter on the network in the future, which will save a little bandwidth, and
helpful on battery-powered devices. may be helpful on battery-powered devices.
The spanning tree is now constructed a little differently. Previously, in a stable The spanning tree is now constructed a little differently. Previously, in a
network, each node would select a new parent only if this reduced the length of stable network, each node would select a new parent only if this reduced the
the path to the root of the tree, measured by the number of other Yggdrasil nodes length of the path to the root of the tree, measured by the number of other
in the path. This has the virtue of simplicity, but it sometimes leads to poor Yggdrasil nodes in the path. This has the virtue of simplicity, but it sometimes
performance when a node replaces a few low-latency/high-bandwidth local links with leads to poor performance when a node replaces a few low-latency/high-bandwidth
a comparatively high-latency/low-bandwidth link over the internet (or an anonymous local links with a comparatively high-latency/low-bandwidth link over the
overlay like [tor](https://github.com/yggdrasil-network/public-peers/blob/master/other/tor.md) internet (or an anonymous overlay like [Tor](https://github.com/yggdrasil-network/public-peers/blob/master/other/tor.md)
or [i2p](https://github.com/yggdrasil-network/public-peers/blob/master/other/i2p.md)). or [I2P](https://github.com/yggdrasil-network/public-peers/blob/master/other/i2p.md)).
Starting with this release, nodes will switch to a new parent if it provides a Starting with this release, nodes will switch to a new parent if it provides a
consistency lower latency path to the root, and its less eager to immediately switch consistency lower latency path to the root, and its less eager to immediately
again after having just changed parents. This should lead to lower latency in stable switch again after having just changed parents. This should lead to lower
networks, and better reliability in unstable ones. latency in stable networks, and better reliability in unstable ones.
We've fixed a reasonable number of bugs and crashes, including in the DHT, We've fixed a reasonable number of bugs and crashes, including in the DHT,
switch and ICMPv6 code, and have made a number of additions to the admin socket switch and ICMPv6 code, and have made a number of additions to the admin socket