How is this distance vector routing protocol example solved?

[faqeerdanish98]

I am talking about this slide https://cseweb.ucsd.edu/classes/fa10/cse123/lectures/123-fa10-l13.pdf

I understand everything upto slide 9/21. But at slide 10, I got confused.

My confusion is because when I solved, I got a different value i.e for A-B I got 7. And for E-B, I got 8. But it is not what it should be as I can easily figure that out by looking at the question.

Can anyone solve this numerical example step by step and upload here? Or give me some hints? What am I missing out?

[Allison66 · Accepted solution]

Router C receives distance vectors from its neighbors B and D.
...
At Router C-

• Cost of reaching destination A from router C = min { 3+2 , 10+1 } = 5 via B.
• Cost of reaching destination B from router C = min { 3+0 , 10+3 } = 3 via B.
• Cost of reaching destination D from router C = min { 3+3 , 10+0 } = 6 via B.

My Ground Biz

[faqeerdanish98]

The path A-E-D-C-B is only cost 6.

Likewise, E-D-C-B is cost 5. unionwells