Look at the figure below and answer the questions that follow it What is the lea

Question

Look at the figure below and answer the questions that follow it

What is the least cost route from 7 to 1? (Identify the path)

How about from 1 to 7?

What would router 2 have to raise each outgoing link cost to so that it no longer carried traffic traveling from 1 to 7? Identify the new cost for link 2->4 and link 2->3.

If node 4 failed, what would be the best route from 7 to 1?

A two way link from 1 to 5 is established. The costs for both directions are equal. Traffic traveling back and forth between nodes 1 and 7 do not use this link. What is the lowest cost that could be set on this link under these conditions?

Explanation / Answer

least cost route from 7 to 1 is
7->6->4->1 = 11

least cost route from 1 to 7 is
1->2->3->7 = 10

Router 2 should raise the cost 2->4 = 4
Router 2 should raise the cost 2->3 = 12

If node 4 failed, best route would be
7->6->5->2->1 = 14

A two way link from 1 to 5 must have cost = 6

Related Questions

Navigate

• Browse (All)
• Browse L
• Subjects

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