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 leave (TTL) field.
Comparison between Distance Vector Routing and Link State Routing:
My Personal Notes arrow_drop_up
- Routing Interface Protocol (RIP) V1 & V2
- Computer Networks | Unicast Routing - Link State Routing
- Computer Network | Routing Information Protocol (RIP)
- Computer Network | Network address translation (NAT)
- Computer Network | Link state advertisement (LSA)
- Computer Network | Classes of routing protocols
- Open shortest path first (OSPF) router roles and configuration
- Computer Network | Classification of Routing Algorithms
- Computer Network | Open shortest path first (OSPF) protocol fundamentals
- Computer Network | EIGRP fundamentals
- Network Security | The CIA triad
- Computer Network | Fixed and Flooding Routing algorithms
- Computer Network | (Route Poisoning and Count to infinity problem)
- Computer Network | TCP 3-Way Handshake Process
- Computer Network | Routing Protocols Set 1 (Distance Vector Routing)
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.