Answer:
Each router builds a cost-weighted graph of the network of all the routers and the shortest links between them, based on information received from each router regarding only its nearest neighbors.
Explanation:
A routing protocol can be defined as a set of defined rules or algorithms used by routers to determine the communication paths unto which data should be exchanged between the source router and destination or host device.
Additionally, in order for packets to be sent to a remote destination, these three parameters must be configured on a host.
I. Default gateway
II. IP address
III. Subnet mask
After a router successfully determines the destination network, the router checks the routing table for the resulting destination network number. If a match is found, the interface associated with the network number receives the packets. Else, the default gateway configured is used. Also, If there is no default gateway, the packet is dropped.
Basically, there are two (2) main categories of routing protocols used in packet switching networks and these includes;
1. Distance-vector routing.
2. Link state routing.
Link state routing refers to a complex routing technique in which each router learns about it's own neighborhood or directly connected networks (links) and shares the information with every other router present in the network.
Hence, the statement which best describes Link State routing is that, each router builds a cost-weighted graph of the network of all the routers and the shortest links between them, based on information received from each router regarding only its nearest neighbors. Some examples are intermediate system to intermediate system (IS-IS) and open shortest path first (OSPF).
