With regard to singlecopy routing, the typical work is the firstcontact. For each node of a network, the algorithm determines a routing table, which in each destination, matches an output line. Cisco routers, for example, attribute a value known as the administrative distance to each. Correctness, simplicity, robustness, stability, fairness, and optimality. This algorithm takes the connectivity between the nodes and link cost as input, and this. The routing algorithm selects the single receiver from the group based on which is the nearest according to some distance measure. Sink trees the set of optimal routes to a particular node forms a sink tree. An adaptive routing algorithm can be classified into three parts. Optimality principle a adaptive routing algorithm if router j is on the optimal path from i to k, then the optimal path from j to k also falls along the same route. It states that if router j is on the optimal path from router i to router k, then the optimal path from j to k also falls along the same route.
Optimality principle if router j is on the optimal path from router i to router k, then the optimal path from j to k also falls along the same route set of optimal routes from all sources to a given destination form a tree rooted at the destination sink tree goal of all routing algorithms. Routing algorithm at a router decides which output line an incoming packet. A routing algorithm is a method for determining the routing of packets in a node. Computer networks unit iii y3s5 dept of cse,rgcet page 7 routing algorithms the routing algorithm is that part of the network layer software responsible for deciding which output line an incoming packet should be transmitted on.
Pages in category routing algorithms the following 43 pages are in this category, out of 43 total. Ouni 3 routing algorithms routing main function of network layer routing algorithm decides which output line incoming packet should be. To date, many energyefficient routing protocol have been proposed to. Cen445 network protocols and algorithms chapter 5 network. To see this, call the part of the route from i to jr1 and the rest of the route r2. Pdf survey on routing algorithms in opportunistic networks. Optimality principle based sink tree methodology for. The algorithm should lead to a consistent routing, that is to say without loop. In this example, the time required for the broadcast packet to reach all nodes is the. It is also known as global routing algorithm as it computes the leastcost path between source and destination by using complete and global knowledge about the network. Fixed and flooding routing algorithms in most of the situations, packets require multiple hops to make a journey towards the destination. Such a calculation is an example of a centralized routing algorithm. Optimality principle based sink tree methodology for adaptive static routing using multiple route configuration scheme is an innovative strategy for integrating dynamic routing protocol attributes seamlessly into static routing.
985 1543 13 141 995 182 1110 976 786 693 1353 1025 858 1233 1551 108 893 123 1008 1333 1015 373 283 1471 1404 1045 1568 395 1238 284 1392 1287 753 1004 1302 158 1434 220 106 338 1469 712 623