... | @@ -21,3 +21,12 @@ We record state transitions in a database histogram and continuously adjust them |
... | @@ -21,3 +21,12 @@ We record state transitions in a database histogram and continuously adjust them |
|
We initially assume that we are in a SUCCESSFUL state.
|
|
We initially assume that we are in a SUCCESSFUL state.
|
|
|
|
|
|
Every subsequent connection attempt is made according to the current STP.
|
|
Every subsequent connection attempt is made according to the current STP.
|
|
|
|
|
|
|
|
The general characteristics of this algorithms are:
|
|
|
|
|
|
|
|
* Starts out with a stationary distribution
|
|
|
|
* After a certain amount of samples have been recorded STP are being updated constantly
|
|
|
|
* MW nodes with good connectivity are favored
|
|
|
|
* Accommodates for short and long term connectivity characteristics
|
|
|
|
|
|
|
|
|