19.7.1 Briefly About A*
Before presenting the result of comparative simulation for A* and our proposed
“desperation” algorithm we should briefly explain what A* means and how it
works. When walking along the graph searching a shortest path to destination is
good to know how much efforts were spent and how much is also required. All
System
complexity
is constant
Reliability of
the system
is limited
Number of elements in the system is n
Performance
of the system
is limited
Achieving maximum reliability/performance with constraints
Max (Pi)
(Pi)
n
provided Pi = const, i =1, …n
Fig. 19.5 Design of a system with constrains
282
19 Distributed Systems: Resilience, Desperation
Before presenting the result of comparative simulation for A* and our proposed
“desperation” algorithm we should briefly explain what A* means and how it
works. When walking along the graph searching a shortest path to destination is
good to know how much efforts were spent and how much is also required. All
System
complexity
is constant
Reliability of
the system
is limited
Number of elements in the system is n
Performance
of the system
is limited
Achieving maximum reliability/performance with constraints
Max (Pi)
(Pi)
n
provided Pi = const, i =1, …n
Fig. 19.5 Design of a system with constrains
282
19 Distributed Systems: Resilience, Desperation