(15 points) In DSDV routing algorithm, when a node sends its routing information

Question

(15 points) In DSDV routing algorithm, when a node sends its routing information to neighbors, it does not include the next hop of each route. For example, in the following figure, B only sends the Destination, Metric, and Sequence No. of each route to neighbors. Why we can omit the information about Next Hop in this process? 2. (A, 1, A-550 (B, 0, B-102) (C, 1, C-588) A, 1, A-550) (?, ?, ?-102) (C, 1, C-588) Dest. Next Metric Seq Dest. Next Metric SeqDest. Next Metric Seq A A0 A-550 A A 1 A-550 A B2 A-550 1B-102 Bl 1 B-102|| B | B | 0 B-102 B-102 ess

Explanation / Answer

DSDV stands for destination sequenced distance vector routing.It is based on bellman ford algorithm. It makes use of destination address ,metric and sequence number to reach the next hop .sequence number is updated by router timely .the update is both time-driven and event-driven .However we omit sequence number if the sequence number is same as previous one and route with better metric is taken into account .so we can omit informtion about next hop

Related Questions

Navigate

• Browse (All)
• Browse #
• Subjects

---

---

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