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:
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.
Recommended Posts:
- Unicast Routing - Link State Routing
- Optimized Link State Routing Protocol
- Difference between Hard link and Soft link
- Difference between External link and Internal link
- Difference between Classful Routing and Classless Routing
- Distance Vector Routing (DVR) Protocol
- Cisco Discovery Protocol (CDP) and Link Layer Discovery Protocol (LLDP) in Data Link Layer
- Link State Advertisement (LSA)
- vector :: cbegin() and vector :: cend() in C++ STL
- Difference Between High-level Data Link Control (HDLC) and Point-to-Point Protocol (PPP)
- Difference between Adaptive and Non-Adaptive Routing algorithms
- Difference between Static and Dynamic Routing
- Difference between Border Gateway Protocol (BGP) and Routing Information Protocol (RIP)
- Difference between Hierarchical and Flat routing protocol
- Difference between Transparent Bridge and Source Routing Bridge
- Difference between Hard Disk Drive (HDD) and Solid State Drive (SSD)
- Differences between Intradomain and Interdomain Routing
- Shortest Path Problem Between Routing Terminals - Implementation in Python
- Difference between std::remove and vector::erase for vectors
- Difference between std::swap and std::vector::swap
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
