Content deleted Content added
→The Optimized Link State Routing Protocol for mobile ad hoc networks: Clean up/copyedit |
mv material from Interior gateway protocol |
||
Line 7:
This contrasts with [[distance-vector routing protocol]]s, which work by having each node share its routing table with its neighbours, in a link-state protocol the only information passed between nodes is ''connectivity related''. Link-state algorithms are sometimes characterized informally as each router, "telling the world about its neighbors."
==Overview==
In [[link-state routing protocol]]s, each router possesses information about the complete network topology. Each router then independently calculates the best next hop from it for every possible destination in the network using local information of the topology. The collection of best-next-hops forms the routing table.
This contrasts with distance-vector routing protocols, which work by having each node share its routing table with its neighbours. In a link-state protocol, the only information passed between the nodes is the information used to construct the connectivity maps.
Examples of link-state routing protocols:
* [[Open Shortest Path First]] (OSPF)
* [[Intermediate system to intermediate system]] (IS-IS)
==History==
| |||