Tag Archives: Routing


Routing Protocols Distance-Vector Protocols: RIPv1, RIPv2, IGRP, EIGRP Based on Bellman–Ford algorithm, Ford–Fulkerson algorithm or DUAL FSM A node inform to the neighbors about the topology changes. Each node doesn’t have knowledge of the entire path to a destination. They know about the direction and the distance to its destination. Less computational complexity and message overhead. Best route… Read More »