|  | 1.5 | Routing and the Different Classes of Routing Protocols
| 1.5.11 | Distance vector and link state routing
You can compare distance-vector routing to link-state routing in several key areas: Distance-vector routing gets all topological data from the routing table information of its neighbors. Link-state routing obtains a complete view of the network topology by accumulating information from LSAs from both neighboring and distant routers. Distance-vector routing determines the best path by adding to the metric value it receives as tables move from router to router. For link-state routing, each router works separately to calculate its own shortest path to destinations. With most distance-vector routing protocols, updates for topology changes come in periodic table updates. These tables pass from router to router, often resulting in slower convergence. With link-state routing protocols, updates usually are triggered by topology changes. Relatively small LSAs passed to all other routers usually result in faster time to converge on any network topology change.