|
|
MuWire uses a Markov based algorithm to control connectivity between peers. We consider three states that MuWire connections can be in:
|
|
|
MuWire uses a Markov based algorithm to control connectivity between peers. We consider three states that MuWire connections can be in at any given time:
|
|
|
|
|
|
* (S)UCCESSFUL
|
|
|
* (R)EJECTED
|
... | ... | @@ -10,3 +10,9 @@ Every state has 3 transition probabilities to reach any of the other states. |
|
|
* R->S, R->R and R->F
|
|
|
* F->S, F->R and F->F
|
|
|
|
|
|
The 9 state transition probabilities ( STP ) are adjusted during runtime and initially have the following values:
|
|
|
|
|
|
* 0.5, 0.0 and 0.5
|
|
|
* 0.5, 0.0 and 0.5
|
|
|
* 0.5, 0.0 and 0.5
|
|
|
|