I\'m not exactly sure how I should proceed with this question... any and all hel

Question

I'm not exactly sure how I should proceed with this question... any and all help would be appreciated!

You are given a directed network G = (V, A) and a source vertex s from which you wish to broadcast a message using a directed tree to every other node. Each arc a has a survivability probability p_a (that is a failure probability of 1 - p_a). So the probability that the message is successfully broadcast along a path Q is p(Q) = Maximum survivals Paths Problem is to find a direct path with maximum survivability probability from s to every' other vertex. Show how to solve this problem in polynomial time.

Explanation / Answer

Store-and-forward one-to-all broadcast:

1. 1-port vs all-,port

2. tori

3. meshes

4. Hypercube

5. EREW PRAM

Hope the above algorithms would be helpful..

Related Questions

Navigate

• Browse (All)
• Browse I
• Subjects

---

---

Integrity-first tutoring: explanations and feedback only — we do not complete graded work. Learn more.