Figure 6.20 is a graph that represents a communication network, where the nodes are receiver/repeater boxes and the edges (or links) represent communication channels, which, if connected, convey the message perfectly. However, there is the probability q = 1 - p that it will be whole.
Use a tree diagram like Figure 6.2.

Figure 6.20.

Figure 6.2.

(a) What is the probability that at least one working path is available between the nodes labeled A and B?

(b) Remove link 4. Now what is the probability that at least one working path is available between nodes A and B?

(c) Remove link 2. What is the probability that at least one working path is available between nodes A and B?

(d) Which is the more serious situation, the removal of link 4 or link 2? Why?

Transcribed Image Text:

3 (2) (1) (5) х 49 Other 48 Other Other (Success) х 48. х Other (Success) Other х (Success) Other Other х х 48, Other (Success) х х (Success) Other (47) Other 48A Other х (Success) 46 48 Other Other х (46 Other 49. () () Other х 48, х Other 48. (Success) х (Success) Other 46 48 Other х (Success) х Other Other х 48, Other 45 Other Other х (Success) 46 48 3. 48 Other х Other (49, Other Other х 49 Other Other 48 Other Other +19