Computer Networks Question: 3 3.1 Consider a network with N routers which are co

Question

Computer Networks Question:

3 3.1 Consider a network with N routers which are connected in star topology. The link weights are all W. A distance vector protocol with poisoned reverse is used. Messages are sent to neighbors only after the distance vector changes. After the protocol stabilizes, one of the link weights changes (nodes on both sides will notice the weight change). What is the maximum number of messages that will be transmitted as a result? (explain your answer) 3.2 Consider a topology which is a complete graph (i.e. all the routers are connected to each other). The link weights are all 2. Suppose one of the link weights is now changed from 2 to 3 (nodes on both sides will notice the weight change), what is the maximum number of messages that will be transmitted as a result?

Explanation / Answer

3.1

Here there are N routers and one is in middle and remaining n-1 are connected to the next router. So any change will be noticed by the end devices, means that middle device also notice. Now there are remaining n-2 routers. So the maximum number of messages that will be transmitted is n-2.

3.2

If one link is updated to 3 then the end devices will send the update message to all other devices. So for each of the end devices, n-2 update messages will be send. So a total of 2*(n-2) messages will be send

Related Questions

Navigate

• Browse (All)
• Browse C
• Subjects

---

---

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