link-state protocol

A routing protocol that calls for each router to build a database of the names of its

neighboring routers and the cost to connect to each. Once all routers in a network have done so, each has a map of the entire network and can calculate the costs of each available route, from end to end. Open Shortest Path First (OSPF) is an example of a link-state protocol. See also database, OSPF, protocol, and router.

• Figure R-2
• Figure S-1
• Figure S-10
• Figure S-11
• Figure S-12
• Figure S-2
• Figure S-3
• Figure S-4
• Figure S-5
• Figure S-6
• Figure S-7
• Figure S-8
• Figure S-9
• Figure T-1
• Figure T-2
• Figure T-3
• Figure T-4
• Figure T-5
• Figure T-6
• Figure U-1
• Figure U-2
• Figure U-3
• Figure V-1
• Figure W-1
• Figure X-1