Question: Router R has the table shown below listing five destinations A-E, and three neighbor routers S, T, U. It updates its table using the usual
Router R has the table shown below listing five destinations A-E, and three neighbor routers S, T, U. It updates its table using the usual distance-vector algorithm, where dist is the distance in hops.
Original table:
| net | dist | nexthop |
| A | 5 | S |
| B | 4 | U |
| C | 6 | T |
| D | 7 | T |
| E | 8 | S |
Suppose R receives the table below as its next distance-vector report from neighbor S.
| net | dist |
| A | 8 |
| B | 4 |
| C | 4 |
| D | 6 |
| E | 6 |
| F | 4 |
Give Rs updated table and a brief explanation of each change
Step by Step Solution
There are 3 Steps involved in it
Get step-by-step solutions from verified subject matter experts
