Prerequisite – Distance vector routing protocol, Link state routing protocol
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. There are mainly 3 different classes of routing protocols:
1. Distance Vector Routing Protocol – These protocols selects best path in the basis of hop counts to reach a destination network in the particular direction. Dynamic protocol like RIP is an example of distance vector routing protocol. Hop count is each router which occurs in between the source and the destination network. The path with the least hop count will be chosen as the best path.
- Updates of network are exchanged periodically.
- Updates (routing information) is always broadcast.
- Full routing tables are sent in updates.
- Routers always trust on routing information received from neighbor routers. This is also known as routing on rumors.
- As the routing information are exchanged periodically, unnecessary traffic is generated which consumes available bandwidth.
- As full routing tables are exchanged, therefore it has security issues. If an authorized person enters the network, then the whole topology will be very easy to understand.
- Also broadcasting of network periodically creates unnecessary traffic.
2. Link State Routing Protocol – These protocols know more about the Internetwork than any other distance vector routing protocol. These re also known as SPF (Shortest Path First) protocol. OSPF is an example of link state routing protocol.
- Hello messages, also known as keep-alive messages are used for neighbor discovery and recovery.
- Concept of triggered updates are used i.e updates are triggered only when there is a topology change .
- Only that much updates are exchanged which is requested by the neighbor router.
Link state routing protocol maintains three tables namely:
- Neighbor table- the table which contains information about the neighbors of the router only, i.e, to which adjacency has been formed.
- Topology table- This table contains information about the whole topology i.e contains both best and backup routes to particular advertised network.
- Routing table- This table contains all the best routes to the advertised network.
- As it maintains separate tables for both best route and the backup routes ( whole topology) therefore it has more knowledge of the inter network than any other distance vector routing protocol.
- Concept of triggered updates are used therefore no more unnecessary bandwidth consumption is seen like in distance vector routing protocol.
- Partial updates are triggered when there is a topology change, not a full update like distance vector routing protocol where whole routing table is exchanged.
3. Advanced Distance vector routing protocol – It is also known as hybrid routing protocol which uses the concept of both distance vector and link state routing protocol. Enhanced Interior Gateway Routing Protocol (EIGRP) is an example of this class if routing protocol. EIGRP acts as a link state routing protocol as it uses the concept of Hello protocol for neighbor discovery and forming adjacency. Also, partial updates are triggered when a change occurs. EIGRP acts as distance vector routing protocol as it learned routes from directly connected neighbors.
Attention reader! Don’t stop learning now. Get hold of all the important CS Theory concepts for SDE interviews with the CS Theory Course at a student-friendly price and become industry ready.
- Routing v/s Routed Protocols in Computer Network
- Difference between Classful Routing and Classless Routing
- Difference between Distance vector routing and Link State routing
- Unicast Routing - Link State Routing
- Protocols in Application Layer
- Sliding Window protocols Summary With Questions
- Controlled Access Protocols in Computer Network
- Multiple Access Protocols in Computer Network
- Collision-Free Protocols in Computer Network
- Examples of Data Link Layer Protocols
- Difference between Adaptive and Non-Adaptive Routing algorithms
- Distance Vector Routing (DVR) Protocol
- Fixed and Flooding Routing algorithms
- Features of Enhanced Interior Gateway Routing Protocol (EIGRP)
- Classification of Routing Algorithms
- Types of Routing
- Classless Inter Domain Routing (CIDR)
- Differences between Intradomain and Interdomain Routing
- Difference between Static and Dynamic Routing
- Routing Tables in Computer Network
If you like GeeksforGeeks and would like to contribute, you can also write an article using contribute.geeksforgeeks.org or mail your article to firstname.lastname@example.org. See your article appearing on the GeeksforGeeks main page and help other Geeks.
Please Improve this article if you find anything incorrect by clicking on the "Improve Article" button below.