Routing Algorithm

Diffusing Update Algorithm (DUAL): In EIGRP, this is the algorithm performed on the topology table to converge the network that provides loop-free operation at every instant throughout a route computation. This allows routers involved in a topology change to synchronize at the same time, while not involving routers that are unaffected by the change. Dijkstra algorithm Routing algorithm that iterates on length of path to determine a set of shortest paths in a shortest-path tree. Commonly used in link-state routing algorithms. Sometimes called “shortest path first algorithm.” This algorithm is used by OSPF. 

Distance-vector routing protocol Class of routing algorithms that have neighbors exchange routing tables and use the Bellman-Ford algorithm to find shortest paths. Distance vector routing algorithms can be prone to routing loops but are computationally simpler and require fewer resources than link-state routing algorithms. 

Summarization When subnets or IANA addresses are included in a larger address, where the address is written with a prefix or mask that includes the subnets. For example, 172.16.128.0/24– 172.16.240.0/24 is represented by the subnet 172.16.128.0/17. 

Super net A summarization of classful networks. For example, a group of Class C addresses 200.100.16.0 through 200.100.31.0 could be summarized into the address 200.100.16.0 with a mask of 255.255.240.0 (/20).