Dijkstra Algorithm

截屏2022-10-14 上午11.23.57.png

截屏2022-10-14 上午11.35.23.png

截屏2022-10-14 上午11.35.39.png

5.2

A Distance Vector Routing(DVR) requires that a router informs its neighbors of topology changes periodically. The Distance Vector Routing(DVR) protocols have a major issue of Routing Loops because the Bellman-Ford algorithm cannot prevent loops.

Count-to-infinity problem: The Count to Infinity problem arises from the routing loop in this Distance Vector Routing(DVR) network. Such Routing Loops usually occurs when 2 routers send an update together at the same time or when an interface goes down.

截屏2022-10-14 上午11.47.01.png

截屏2022-10-14 上午11.48.09.png

hop-count limit:

split horizon advertisements: