What are the criteria for a good routing algorithm?

One of the most commonly used routing algorithms is Dijkstra’s algorithm . Dijkstra’s algorithm finds the shortest path between two nodes by building a shortest-path tree, and stopping once the destination node has been reached.

Correctness: The routing should be done properly and correctly so that the packets may reach their proper destination. Simplicity: The routing should be done in a simple manner so that the overhead is as low as possible. With increasing complexity of the routing algorithms the overhead also increases.

A routing algorithm is a procedure that lays down the route or path to transfer data packets from source to the destination . They help in directing Internet traffic efficiently. After a data packet leaves its source, it can choose among the many different paths to reach its destination.

Routing Algorithms can be classified based on the following:

bellman-ford algorithm 2. Dijkstra’s Algorithm 3. The Floyd Warshall Algorithm.

Shortest path, most of the time is calculated based on ‘Bandwidth’. Thus, overall which path provides more bandwidth, that path is considered shortest path , thus Optimal Routing.