Routing

What
Routing is an important function for the network layer to perform in order to calculate the path for a datagram to take while travelling between hosts

Global Routing Algorithm
This type of algorithm has information about all the routers in its network and uses this complete information to compute the shortest paths. These algorithms are also known as link state routing algorithms

Decentralized Routing Algorithm
This type of algorithm is run on individual routers in the networks and the least cost is computed iteratively over each of the routers. An example of this type of algorithm is called the distance vector algorithm

Static Routing Algorithm
This type of routing algorithm changes the paths of the routers very slowly, and usually as a result of human interaction

Dynamic Routing Algorithm
This type of routing algorithm changes the flow of data as the network topology changes.

Load Sensitive Algorithm
This type of algorithm changes the cost of a link as its traffic increases

Load Insensitive Algorithm
This type of algorithm does not change the cost of a link as its traffic increases