動態路由協議
Dynamic routing protocols have been divided into 2 categories i.e Distance vector protocols and Link state protocols. Both of these protocols are being explained in detail in this tutorial.
動態路由協議分為距離矢量協議和鏈路狀態協議兩大類 。 本教程將詳細說明這兩種協議。
1)距離矢量路由協議 (1) Distance Vector Routing Protocols)
RIP and IGRP are the distance vector routing protocols. All the distance vector routing protocols have some features which are being given below.
RIP和IGRP是距離矢量路由協議。 所有距離矢量路由協議都具有以下功能。
The periodic updates of the entire routing table are sent to all neighboring routers.
整個路由表的定期更新將發送到所有相鄰路由器。
Convergence is very slow in distance vector protocols and these are susceptible to protocols loops.
距離矢量協議的收斂非常慢，并且容易受到協議循環的影響。
The distance is used to calculate the metric of the routing.
距離用于計算路由度量。
Bellman-Ford algorithm is used to find the shortest path.
Bellman-Ford算法用于查找最短路徑。
Distance vector routing protocols send updates about all connected neighbors directly connected networks. This update is sent regularly. It is sent to RIP every 30 seconds and in IGRP, this update is sent every 90 seconds. With these updates, neighbors can add routes to their routing tables. After this, all the neighbors forward their entire routing table, sharing it with all the neighbors.
距離矢量路由協議發送有關所有已連接鄰居的直連網絡的更新。 此更新會定期發送。 它每30秒發送到RIP，在IGRP中，此更新每90秒發送一次。 通過這些更新，鄰居可以將路由添加到其路由表中。 此后，所有鄰居都轉發其整個路由表，并與所有鄰居共享。
There are many disadvantages to this kind of process. Routing information goes from one neighbor to pass periodic updates of another, so convergence is very slow. Together, all the neighbors depend on each other, so the chances of looping are also very high.
這種過程有很多缺點。 路由信息從一個鄰居傳到另一個鄰居的定期更新，因此收斂非常慢。 在一起，所有鄰居都相互依賴，因此循環的機會也很高。
Distance vector protocols use distance to calculate metric. RIP is calculated by metric hop counts. In IGRP the metric is calculated with bandwidth and delay.
距離矢量協議使用距離來計算度量。 RIP通過躍點計數來計算。 在IGRP中，度量標準是根據帶寬和延遲來計算的。
2)鏈路狀態路由協議 (2) Link State Routing Protocols)
Link state protocols were developed to overcome looping and convergence problems in the distance vector protocols. Link state routing protocols build 3 kinds of routing tables. These are being given below.
開發了鏈路狀態協議以克服距離矢量協議中的循環和收斂問題。 鏈路狀態路由協議建立3種路由表。 這些在下面給出。
Neighbor table
鄰居表
This table contains a list of all the neighbors, and also, which of the neighbors is connected to which interface. Neighbor table is created by sending hello packets.
該表包含所有鄰居的列表，以及哪個鄰居連接到哪個接口。 鄰居表是通過發送hello數據包創建的。
Topology table
拓撲表
This is also called link state table. In this, all links of one area are stored in the map. Also, every link's status is also stored.
這也稱為鏈接狀態表。 這樣，一個區域的所有鏈接都存儲在地圖中。 同樣，每個鏈接的狀態也會被存儲。
Shortest path table
最短路徑表
The best routes are stored for every destination in this table. The link states sending updates about the status of routers directly connected networks in routing protocols. All routers store this information in the topology table. The number of routers within an area is their topology table.
最佳路線存儲在此表中的每個目的地。 鏈接狀態發送有關路由協議中與路由器直接連接的網絡的狀態有關的更新。 所有路由器都將此信息存儲在拓撲表中。 一個區域內的路由器數量是其拓撲表。
If any change occurs in a link, only related updates to this link are sent to all routers and all routers adjust their topology table accordingly. The only link that has changed has been updated, due to this, the bandwidth also does not have much effect. But due to the management of 3 tables, the CPU is highly utilized. The shortest path is calculated by the Dijkstra formula in the link state protocols.
如果鏈接發生任何更改，則僅對此鏈接的相關更新會發送到所有路由器，并且所有路由器都會相應地調整其拓撲表。 唯一已更改的鏈接已更新，因此，帶寬也沒有太大影響。 但是由于管理3個表，因此CPU利用率很高。 最短路徑由鏈路狀態協議中的Dijkstra公式計算得出。
翻譯自: https://www.includehelp.com/computer-networks/categories-of-dynamic-routing-protocols.aspx
動態路由協議
)
