Menu
Home
People
Places
Arts
History
Plants & Animals
Science
Life & Culture
Technology
Reference.org
Destination-Sequenced Distance Vector routing
open-in-new
<p>Destination-Sequenced Distance-Vector Routing (DSDV) is a table-driven routing scheme for <a href="/facts/Mobile_ad_hoc_network/Gwb3FlAD">ad hoc mobile networks</a> based on the <a href="/facts/Bellman%25E2%2580%2593Ford_algorithm/Sx6INcdr">Bellman–Ford algorithm</a>. It was developed by C. Perkins and P. Bhagwat in 1994. The main contribution of the algorithm was to solve the <a href="/facts/Routing_loop_problem/ACljX675">routing loop problem</a>. Each entry in the routing table contains a sequence number, the sequence numbers are generally even if a link is present; else, an odd number is used. The number is generated by the destination, and the emitter needs to send out the next update with this number. Routing information is distributed between nodes by sending <i>full dumps</i> infrequently and smaller incremental updates more frequently. </p><p>For example, the routing table of Node A in this network is </p> <table><tbody><tr><th>Destination</th><th>Next Hop</th><th>Number of Hops</th><th>Sequence Number</th><th>Install Time</th></tr><tr><td>A</td><td>A</td><td>0</td><td>A 46</td><td>002000</td></tr><tr><td>B</td><td>B</td><td>1</td><td>B 36</td><td>002200</td></tr><tr><td>C</td><td>B</td><td>2</td><td>C 28</td><td>002500</td></tr></tbody></table> <p>Naturally the table contains description of all possible paths reachable by node A, along with the next hop, number of hops and sequence number. </p>