|
Size: 922
Comment:
|
Size: 1052
Comment: cleaned
|
| Deletions are marked like this. | Additions are marked like this. |
| Line 3: | Line 3: |
| Subject: Life probability | Subject: Life probability |
| Line 17: | Line 17: |
| in a multipath route we prefer to don't use very young nodes as main routes. | we prefer to avoid routes which contain very young nodes. |
| Line 20: | Line 20: |
| A / \ L K \ / |
A / \ L K \ / |
| Line 25: | Line 25: |
| }} | }}} |
| Line 30: | Line 30: |
| === Implementation === In the TP we record the uptime of each traversed node. In this way, the node receiving the TP will be able to discriminate young routes from stable ones. |
|
| Line 31: | Line 36: |
| related: ["Netsukuku RFC"] | related: [Netsukuku_RFC] |
NTK_RFC 0005
Subject: Life probability
This text describes a change to the Npv7. It will be included in the final documentation, so feel free to correct it. But if you want to change the system here described, please contact us first.
Statistically the probability of a node to continue to stay up is related to its uptime, for example if the node X has an uptime of 30 seconds and the node Y of 1200 seconds, then it is more probable that the node Y will continue to stay up.
For this reason we give higher credits to older nodes/gnodes, this means that we prefer to avoid routes which contain very young nodes.
A
/ \
L K
\ /
NLet's say K has an uptime of 600 seconds and L of 200. The node N, to reach A, will prefer the node K.
Implementation
In the TP we record the uptime of each traversed node. In this way, the node receiving the TP will be able to discriminate young routes from stable ones.
related: [Netsukuku_RFC]