... | ... | @@ -28,5 +28,16 @@ The general characteristics of this algorithms are: |
|
|
* After a certain amount of samples have been recorded STP's are being updated constantly
|
|
|
* MW nodes with good connectivity are favored as connection attempts with higher STP's are more likely to occur
|
|
|
* Accommodates for short and long term connectivity characteristics
|
|
|
* Nodes that fail constantly will eventually reach a FF STP of 1.0 so they will not be connected any more
|
|
|
|
|
|
After a node has reached a certain FF threshold ( currently fixed at 95% ) it is considered to be hopeless and is therefore purged from the history and connection table.
|
|
|
|
|
|
No further outgoing connection attempts are made to this node.
|
|
|
|
|
|
If however at any point in the future the hopeless node is able to reconnect with us ( incoming connection ) it will be treated according to the initial SUCCESSFUL state.
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|