... | ... | @@ -22,7 +22,14 @@ We record state transitions in a database histogram and continuously adjust them |
|
|
|
|
|
We initially assume that we are in a SUCCESSFUL state and start from there.
|
|
|
|
|
|
Every subsequent connection attempt switches the current state according to the current STP.
|
|
|
We predict the next connection attempt and initiate it.
|
|
|
|
|
|
The result ( observed state ) gets recorded into the db creating a sequence of transition states.
|
|
|
|
|
|
We update the current state to be the observed state.
|
|
|
|
|
|
Finally we calc the 9 STP's according to their frequency in the db history.
|
|
|
|
|
|
|
|
|
The general characteristics of this algorithm are:
|
|
|
|
... | ... | |