|  | 11.5 | The Context of Different Routing Protocols
| 11.5.1 | Distance-vector versus link-state routing protocols
You can compare distance-vector routing to link-state routing in several key areas: Distance-vector routing gets topological data from the routing table information of its neighbors. Link-state routing obtains a wide view of the entire internetwork topology by accumulating all necessary LSAs. Distance-vector routing determines the best path by adding to the metric value that it receives as routing information is passed from router to router. For link-state routing, each router works separately to calculate its own shortest path to destination networks. With most distance-vector routing protocols, updates for topology changes come in periodic table updates. The information passes from router to router, usually resulting in slower convergence. With link-state routing protocols, updates are usually triggered by topology changes. Relatively small LSAs passed to all other routers usually result in faster time to converge on any internetwork topology change.