Difference between Distance vector routing and Link State routing
Prerequisite – Classification of Routing Algorithms
- It is a dynamic routing algorithm in which each router computes distance between itself and each possible destination i.e. its immediate neighbors.
- The router share its knowledge about the whole network to its neighbors and accordingly updates table based on its neighbors.
- The sharing of information with the neighbors takes place at regular intervals.
- It makes use of Bellman Ford Algorithm for making routing tables.
- Problems – Count to infinity problem which can be solved by splitting horizon.
– Good news spread fast and bad news spread slowly.
– Persistent looping problem i.e. loop will be there forever.
- It is a dynamic routing algorithm in which each router shares knowledge of its neighbors with every other router in the network.
- A router sends its information about its neighbors only to all the routers through flooding.
- Information sharing takes place only whenever there is a change.
- It makes use of Dijkastra’s Algorithm for making routing tables.
- Problems – Heavy traffic due to flooding of packets.
– Flooding can result in infinite looping which can be solved by using Time to live (TTL) field.Comparison between Distance Vector Routing and Link State Routing:
Don’t stop now and take your learning to the next level. Learn all the important concepts of Data Structures and Algorithms with the help of the most trusted course: DSA Self Paced. Become industry ready at a student-friendly price.
Recommended Posts:
- Unicast Routing - Link State Routing
- Distance Vector Routing (DVR) Protocol
- Difference between Classful Routing and Classless Routing
- Difference between Static and Dynamic Routing
- Difference between Transparent Bridge and Source Routing Bridge
- Difference between Adaptive and Non-Adaptive Routing algorithms
- Onion Routing
- Types of Routing
- MANET Routing Protocols
- Classes of Routing Protocols
- Classification of Routing Algorithms
- Routing Information Protocol (RIP)
- Routing Information Protocol (RIP) V1 & V2
- Securing Routing Protocols
- Differences between Intradomain and Interdomain Routing
- Fixed and Flooding Routing algorithms
- Routing Tables in Computer Network
- Classless Inter Domain Routing (CIDR)
- Inter VLAN Routing by Layer 3 Switch
- Routing v/s Routed Protocols 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 contribute@geeksforgeeks.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.
Improved By : uno6
