![]() Routing information goes from one neighbor to pass periodic updates of another, so convergence is very slow. There are many disadvantages to this kind of process. After this, all the neighbors forward their entire routing table, sharing it with all the neighbors. With these updates, neighbors can add routes to their routing tables. It is sent to RIP every 30 seconds and in IGRP, this update is sent every 90 seconds. Bellman-Ford algorithm is used to find the shortest path.ĭistance vector routing protocols send updates about all connected neighbors directly connected networks.The distance is used to calculate the metric of the routing. ![]() ![]() Convergence is very slow in distance vector protocols and these are susceptible to protocols loops.The periodic updates of the entire routing table are sent to all neighboring routers.All the distance vector routing protocols have some features which are being given below. RIP and IGRP are the distance vector routing protocols. Both of these protocols are being explained in detail in this tutorial. Submitted by Mahima Rao, on November 19, 2018ĭynamic routing protocols have been divided into 2 categories i.e Distance vector protocols and Link state protocols. Here, we are going to learn about the categories of dynamic routing protocols in computer networks.
0 Comments
Leave a Reply. |
AuthorWrite something about yourself. No need to be fancy, just an overview. ArchivesCategories |