j3d1/tinc
1
0
Fork 0
Code Issues 1 Pull requests Releases Wiki Activity

its: Engels voor "van het" - 3e persoon enkelvoud, genitief, onzijdig

Browse source 
it's: Engels voor "het is". Dus niet "van het".
This commit is contained in:
Wessel Dankers 2002-09-16 14:08:04 +00:00
parent 4f3395ee4d
commit 6904e0469e
1 changed files with 5 additions and 5 deletions
Show stats Download patch file Download diff file Expand all files Collapse all files

10
doc/CONNECTIVITY
View file

@ -12,15 +12,15 @@ maintain a stable network.
provided that the entire resulting derived work is distributed provided that the entire resulting derived work is distributed
under the terms of a permission notice identical to this one. under the terms of a permission notice identical to this one.
$Id: CONNECTIVITY,v 1.1.2.10 2002/09/15 22:19:37 guus Exp $ $Id: CONNECTIVITY,v 1.1.2.11 2002/09/16 14:08:04 wsl Exp $
1. Synchronisation 1. Synchronisation
================== ==================
Each tinc daemon has zero or more connections to other tinc daemons. It will Each tinc daemon has zero or more connections to other tinc daemons. It will
try to keep it's own information synchronised with the other tinc daemons. If try to keep its own information synchronised with the other tinc daemons. If
one of it's peers sends information, the tinc daemon will check if it is new one of its peers sends information, the tinc daemon will check if it is new
information. If so, it will update it's own information and forward the new information. If so, it will update its own information and forward the new
information to all the other peers. information to all the other peers.
This scheme will make sure that after a short amount of time all tinc daemons This scheme will make sure that after a short amount of time all tinc daemons
@ -35,7 +35,7 @@ seen.
2. Routing 2. Routing
========== ==========
Every node tells it's peers to which other peers it is connected. This way Every node tells its peers to which other peers it is connected. This way
every node will eventually know every connection every node has on the VPN. every node will eventually know every connection every node has on the VPN.
Each node will use graph algorithms to determine if other nodes are reachable or not and Each node will use graph algorithms to determine if other nodes are reachable or not and
what the best route is to other nodes. what the best route is to other nodes.