Routing is a process in which the layer 3 devices (either router or layer 3 switch) finds the optimal path to deliver a packet from one network to another. Dynamic routing protocols uses metric, cost and hop count to identify the best path from the path available for destination network.
Distance vector protocols usually send the complete routing table to each neighbor (a neighbor is directly connected router that runs the same routing protocol). They employ some version of Bellman-Ford algorithm to calculate the best routes. Compared with link state routing protocols.
Distance vector protocols are easier to configure and require little management, but are susceptible to routing loops and converge slower than the link state routing protocols. Distance vector protocols also use more bandwidth because they send complete routing table, while the link state protocol send specific updates only when topology changes occur.
Distance vector protocol selects best path in the basis of hop counts to reach a destination network in a specific way. The path will the least hop count will be chosen as best path.
Link State Routing Protocol:
Link state routing protocols are the second type of routing protocols. They have the same basic purpose as distance vector protocols, to find a best path to a destination, but use different methods to do so. Unlike distance vector protocols, link state protocols don’t advertise the entire routing table. Instead, they advertise information about a network topology (directly connected links, neighboring routers…), so that in the end all routers running a link state protocol have the same topology database.
Link state routing protocols converge much faster than distance vector routing protocols, support classless routing, send updates using multicast addresses and use triggered routing updates. They also require more router CPU and memory usage than distance-vector routing protocols and can be harder to configure.
The Link State Routing protocol also known as SPF – Shortest Path First protocol
The main thing is need to understand about the Link routing as an Each router running a link state routing protocol creates three different tables:
This is also known as hybrid routing protocol which uses the concept of both the Distance Vector and Link State Routing protocols.
EIGRP as Enhanced Interior Gateway Routing Protocol is an example of this routing protocol. EIGRP acts as a link state routing protocol as it uses the concept for neighbor discovery also the EIGRP acts as distance vector routing protocol as it leaned routes from directly connected neighbors.
Below are the types of Routing Protocol:
- Distance Vector Routing Protocol
RIP
IGRP
- Link State Routing Protocol
OSPF
IS-IS
- Advanced Distance vector routing protocol
EIGRP
- Distance Vector Routing Protocol
RIP
IGRP
- Link State Routing Protocol
OSPF
IS-IS
- Advanced Distance vector routing protocol
EIGRP
Distance Vector Routing Protocol:
Distance vector protocols usually send the complete routing table to each neighbor (a neighbor is directly connected router that runs the same routing protocol). They employ some version of Bellman-Ford algorithm to calculate the best routes. Compared with link state routing protocols.
Distance vector protocols are easier to configure and require little management, but are susceptible to routing loops and converge slower than the link state routing protocols. Distance vector protocols also use more bandwidth because they send complete routing table, while the link state protocol send specific updates only when topology changes occur.
Distance vector protocol selects best path in the basis of hop counts to reach a destination network in a specific way. The path will the least hop count will be chosen as best path.
Link State Routing Protocol:
Link state routing protocols converge much faster than distance vector routing protocols, support classless routing, send updates using multicast addresses and use triggered routing updates. They also require more router CPU and memory usage than distance-vector routing protocols and can be harder to configure.
The Link State Routing protocol also known as SPF – Shortest Path First protocol
The main thing is need to understand about the Link routing as an Each router running a link state routing protocol creates three different tables:
- neighbor table – the table of neighboring routers running the same link state routing protocol.
- topology table – the table that stores the topology of the entire network.
- routing table – the table that stores the best routes.
Shortest Path First algorithm is used to calculate the best route. OSPF and IS-IS are examples of link state routing protocols.
Advance Distance Vector Routing Protocol:
This is also known as hybrid routing protocol which uses the concept of both the Distance Vector and Link State Routing protocols.
EIGRP as Enhanced Interior Gateway Routing Protocol is an example of this routing protocol. EIGRP acts as a link state routing protocol as it uses the concept for neighbor discovery also the EIGRP acts as distance vector routing protocol as it leaned routes from directly connected neighbors.