Routing Algorithms
🧭 Routing Algorithms Routing algorithms are essential to determine the best path for data to travel across networks. They fall into two broad categories: Distance-Vector and Link-State. 📌 1. Distance Vector Routing Each router maintains a table (vector) that holds the best-known distance to every destination. Based on Bellman-Ford Algorithm Routers exchange vectors with neighbors periodically. Simple but slow convergence; prone to count-to-infinity problems. Example Protocol: RIP (Routing Information Protocol) ...