Each node maintains a list of all destinations and number of hops to each destination.
Each entry is marked with a sequence number.
Periodically send table to all neighbors to maintain topology
Example Of DSDV A’s Routing Table Before Change A’s Routing Table After Change Destination Next Hop Distance Sequence Number A A 0 S205_A B B 1 S334_B C C 1 S198_C D D 1 S567_D E D 2 S767_E F D 2 S45_F Destination Next Hop Distance Sequence Number A A 0 S304_A B D 3 S424_B C C 1 S297_C D D 1 S687_D E D 2 S868_E F D 2 S164_F
Comparison Parameters On Demand Table Driven Availability of routing information Available when needed Always available regardless of need Routing philosophy Flat Mostly flat, except for CGSR Periodic route updates Not required Required Coping with mobility Use localized route discovery Inform other nodes to achieve consistent routing table Signaling traffic generated Grows with increasing mobility Greater than that of on demand routing