Jump to content

Destination-Sequenced Distance Vector routing

From Wikipedia, the free encyclopedia
This is an old revision of this page, as edited by 67.171.32.58 (talk) at 17:17, 2 October 2005. The present address (URL) is a permanent link to this revision, which may differ significantly from the current revision.
(diff) ← Previous revision | Latest revision (diff) | Newer revision → (diff)

Destination-Sequenced Distance-Vector Routing (DSDV) Table-driven routing scheme for ad hoc mobile wireless networks based on the Bellman-Ford algorithm. Improved on the loop problem by using sequence numbers to mark each node. Routing information is distributed between nodes via sending "full dumps" and incremental updates. "Settling time" metric is used to determine update interval.

Retrieved from "https://en.wikipedia.org/w/index.php?title=Destination-Sequenced_Distance_Vector_routing&oldid=24574598"