d
s
d
s
d
s
DCA with VH select destination and
choose only links that have TWO
Heuristic values over coordinates Y
and X that are not zero or negative.
First three links are chosen with
probabilities over them and
direction match initial heuristic.
Follow-up steps with further
estimation of cumulative
probabilities ( desperation control)
over chose links. Again at each step
Hx and Hy ≠ 0 or negative
d
s
d
s
Follow-up step with selection of
cumulative probabilities (desperation
control) over chose links. Again at
each step Hx and Hy ≠ 0 or negative
From preferable candidate further
four links are chosen to evaluate
using cumulative probabilities
(desperation control) over chose
links. Again, at each step Hx and Hy
≠ 0 or negative
(a)
(b)
(c)
(d)
(e)
Fig. 19.7 a Initial state s—source, d—destination. b First three selections along the direction.
c Selected only links with min overall desperation and Hx, Hy 6 ¼ 0. d Selected only links with min
overall desperation and Hx, Hy 6 ¼ 0. e Selected only links with min overall desperation and Hx,
Hy 6 ¼ 0. f Destination has been achieved, and Hx, Hy 6 ¼ 0, check the rest inputs. g Destination has
been achieved, all inputs has been checked
286
19 Distributed Systems: Resilience, Desperation