The Fig. 18.3 presents Forward Tracing Algorithm where pseudocode demonstrates how it works. It starts from the vertex where the threat manifests, in this case
from vertex i, and the impact is analyzed and evaluated by searching from d 1 to all
directly or indirectly connect nodes.
The final result of the search is the “consequence” caused by the threat propagation and is presented in the form of a ranked list of the elements suspected to be
affected.
As all the paths from one node to another are evaluated only the edge with the
highest probability of is tracked at each node. Note that each node is only included
once in any path to guarantee termination in a graph which has loops [3, 4].
The Forwarding Tracing algorithm does solve the problem of threat elimination
from DCS. It is important to note that the manifestation of a threat in one vertex and
the detection of this threat consequences across another vertexes has an arbitrary
duration (the duration varies). Also, while consequences are finally spotted, the
Fig. 18.3 Forward tracing algorithm to determine area of thread propagation
18.3 Resilience and Recoverability in Networked System
259