What are the Neighbor requirements for Distance Vector?
No neighborship required (Just sends it’s route tables out in the wind, doesn’t care if there IS one just sends everything out anyway)
How is the route maintained for Distance Vector?
Resends ENTIRE routing table routes after a defined interval
What is it’s visibility of the network topology for Distance Vector?
Knowledge of topology only extends to directly connected routers
What is the necessary data structure for Distance Vector?
Database of learned routes
What are some protocol examples of Distance Vector?
RIP V1 and RIP V2