 |
| - A - |
| - B - |
| - C - |
| - D - |
| - E - |
| - F - |
| - G - |
| - H - |
| - I - |
| - J - |
| - K - |
| - L - |
| - M - |
| - N - |
| - O - |
| - P - |
| - Q - |
| - R - |
| - S - |
| - T - |
| - U - |
| - V - |
| - W - |
| - X - |
| - Y - |
| - Z - |
Link-state Protocol
Link-state Protocol
Link-state protocol makes up one of the two primary routing protocols used in packet-switched networks. It functions with the aid of every switching node or router in a network. The overall concept is that every router forms a map that represents the connectivity of the entire network. Each router then independently calculates the next best path for all possible destinations in the network. This occurs without any communication between the other routers. From there, a routing table is formed from the collection of paths and designated for each router.
Link-state routing protocol differs from distance vector routing protocol which functions by allowing each router to share it’s routing table with it’s neighbors. In link-state protocol, the only information shared between neighboring routers is the data used to form connectivity maps.
Two examples of link-state routing protocol include OSPF (Open Shortest Path First) and IS-IS (Intermediate System to Intermediate System).