... | ... | @@ -20,16 +20,17 @@ The 9 state transition probabilities ( STP ) are adjusted during runtime and ini |
|
|
|
|
|
We record state transitions in a database histogram and continuously adjust them according to their relative frequency ( non-stationary distribution )
|
|
|
|
|
|
We initially assume that we are in a SUCCESSFUL state and start from there.
|
|
|
A) We take the current state ( initially SUCCESSFUL )
|
|
|
|
|
|
We predict the next connection attempt and initiate it.
|
|
|
B) We predict the next connection attempt and initiate it.
|
|
|
|
|
|
The result ( observed state ) gets recorded into the db creating a sequence of transition states.
|
|
|
C) 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.
|
|
|
D) 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.
|
|
|
E) Finally we re-calculate the 9 STP's according to their frequency in the db history.
|
|
|
|
|
|
we then start at A) again
|
|
|
|
|
|
The general characteristics of this algorithm are:
|
|
|
|
... | ... | |