Before entering into this topic, you need to be aware of what an autonomous system is.
Autonomous system:
Connection of different networks that are managed by a single entity/organization. This whole scenario collectively termed as an "Autonomous system".
For example, large organizations like Facebook has many different networks to be managed all over the world, all these networks are connected to the headquarters of Facebook which manages every network.
→Intradomain routing works inside an autonomous system
→Interdomain routing works between two or more autonomous systems
I hope you have seen my previous post about the basics of routing protocols. Here is my post if you haven't seen it yet!
https://sairohithkaranam.blogspot.com/2020/04/introduction-to-routing-protocols.html
Now, let's learn about Distance Vector Routing. I'm not going in-depth regarding this topic. I just want you to have a basic overlay of this topic.
crux points:
For now, just remember the crux points of distance vector routing.
Autonomous system:
Connection of different networks that are managed by a single entity/organization. This whole scenario collectively termed as an "Autonomous system".
For example, large organizations like Facebook has many different networks to be managed all over the world, all these networks are connected to the headquarters of Facebook which manages every network.
→Intradomain routing works inside an autonomous system
→Interdomain routing works between two or more autonomous systems
I hope you have seen my previous post about the basics of routing protocols. Here is my post if you haven't seen it yet!
https://sairohithkaranam.blogspot.com/2020/04/introduction-to-routing-protocols.html
Now, let's learn about Distance Vector Routing. I'm not going in-depth regarding this topic. I just want you to have a basic overlay of this topic.
crux points:
- Distance vector routing is the sub-category of Intradomain routing
- Distance vector routing determines the best route for packets based on distance.
- Distance is measured by the number of routers, a packet has to pass.
- Uses the bellman ford algorithm to calculate the best route.
- Distance vector routing works on sharing and updating.
- Sharing of the routing table to it's directly connected neighbouring routers is compulsory.
-Every router has a routing table.
-Routing table consists of three things basically
-Name of every router.
-Cost to reach that router
-The routers which are to be passed to reach the destination router. - When sharing of this routing table is not done at the proper time, it leads to Two-node instability or Three-node instability
- Three ways of solving two-node instability
-Defining infinity
-Split Horizon
-Split horizon and poison reverse - Routing Information Protocol (RIP) follows distance vector routing.
For now, just remember the crux points of distance vector routing.
In the next post, we will see about RIP which is an implementation of distance vector routing.
Comments
Post a Comment