小孫的狂想世界

Routing Protocol(路由協定) 主要可以分為兩大類

Distance Vector 和 Link State

以下截自「Computer Networks：A Systems Approach」第四章中

對此二類異處的釋義

In distance vector, each node talks only to its directly connected neighbors, but it tells them everything it has learned.

In link state, each node talks to all other nodes, but it tells them only what it knows for sure.

其中

distance vector 是利用 Bellman-Ford 這個演算法

著名的路由資訊協定 RIP ( Routing Information Protocol ) 即架構在此之上

而 link state 則是利用 Dijkstra 這個演算法

OSPF ( Open Shortest Path First ) 即架構在此之上