Routing Algorithms For The Network

1142 Words5 Pages
Routing Algorithms
Routing as we can say is selecting the best path in the network to transfer data from one point to another. And Routing algorithm on a router in computer networks decides on which incoming line a packet should travel and thus creating the routing decision. It depends on various factors like stability, robustness, simplicity, correctness, fairness and optimality.
Routing algorithms are based on two classes namely. Adaptive : In this the routing process is adapted based on any changes made to the topology or traffic.
Eg: Hierarchical, Link State, distance vector, broadcast and multicast. Non Adaptive: In this process the routing decisions are mostly computed in advance and will be downloaded to the routers at the boot
…show more content…
This is a level 2 routing system and we can use 3-to 4 level of these kind of routings aswell.

2. Link State Routing Protocols: It calculates the best paths to network by constructing the topology of the entire network area and then map the best path from this topology or map of all the interconnected networks. The inputs of LS algorithm i.e network topology and the link costs are known before hand. This can be achieved by having each broadcast link-state packets to every node in the network and thus each link-state containing the cost of its attached links. This is termed as link-state broadcast.
In LS algorithm, every router must do some the following things, Find the clients and record the IP address Gauze the delays and cost of every client. Build a LS packet to send this packet to each and every the router on the network. And then find the shortest path on every router.(Sink tree)
3. Distance Vector Routing: DV algorithm is distributed as it receives information of one or more nodes which are directly attached to it and distributes the same back to its neighbors. It is said to be asynchronous because as it does not need all of the nodes to operate in lockstep with one other. And it is iterative because as this process continues as long as there is no information to be exchanged between the neighbors.
In this routing there are two vectors called a delay node and a successor node, so router ihas
Di =[di1…diN]T and Si=[Si1…SiN]T dij = current estimate of
Get Access