What Are The Design Goals Of Routing Algorithms?
There are different reasons on the basis of which one routing algorithm differs to the other; these reasons vary with the design goals. Each routing algorithm has different design; in fact the design is based on the goals to be achieved during communication or routing. As the design goals are different so is the case with the usage of network and router resources. All routing algorithms have different metrics according to the certain situations to calculate the optimal, in fact the excellent path for routing. Routing algorithms are designed for very efficient communication and to achieve one of these goals; optimality, simplicity and low overhead, robustness, steadiness, rapid convergence and elasticity. All of these design goals offer different services to the communication being held between the networks. One most important must be kept in mind while designing these routing algorithms and that is to keep these algorithms very simple and easy going. If an algorithm design is complex,
Routing algorithms are used for the following purpose.Purpose of a routing algorithm is just to select the best possible route to pass data in any form. Data can be in the form of voice, video, text, images etc. Actually, it is not easy to maintain the efficiency of network without using powerful algorithm. Whenever a huge network is created, then some powerful algorithms are used to maintain data security. Routing algorithms are also used to handle dead lock problem. AS data comes to a workstation, then routing algorithm checks the address of the data as where to send the data to its final destination. More than one possible ways can be used to send the data but it is the duty of the algorithm to check the shortest and efficient path as well as to check which path has more traffic and which has less. If a path has more traffic and there is a chance of deadlock or congestion flow then it is up to the routing algorithm to select that path which does not cause the problem of dead lock. I
