SPF
Time Limit: 1000MS | Memory Limit: 10000K | |
Total Submissions: 2838 | Accepted: 1264 |
Description
Consider the two networks shown below. Assuming that data moves around these networks only between directly connected nodes on a peer-to-peer basis, a failure of a single node, 3, in the network on the left would prevent some of the still available nodes from communicating with each other. Nodes 1 and 2 could still communicate with each other as could nodes 4 and 5, but communication between any other pairs of nodes would no longer be possible.
Node 3 is therefore a Single Point of Failure (SPF) for this network. St
Node 3 is therefore a Single Point of Failure (SPF) for this network. St