answersLogoWhite

0

  1. Adaptive Routing Algorithm: These algorithms change their routing decisions to reflect changes in the topology and in traffic as well. These get their routing information from adjacent routers or from all routers. The optimization parameters are the distance, number of hops and estimated transit time. This can be further classified as follows:
    1. Centralized: In this type some central node in the network gets entire information about the network topology, about the traffic and about other nodes. This then transmits this information to the respective routers. The advantage of this is that only one node is required to keep the information. The disadvantage is that if the central node goes down the entire network is down, i.e. single point of failure.
    2. Isolated: In this method the node decides the routing without seeking information from other nodes. The sending node does not know about the status of a particular link. The disadvantage is that the packet may be send through a congested route resulting in a delay. Some examples of this type of algorithm for routing are:
  • Hot Potato: When a packet comes to a node, it tries to get rid of it as fast as it can, by putting it on the shortest output queue without regard to where that link leads. A variation of this algorithm is to combine static routing with the hot potato algorithm. When a packet arrives, the routing algorithm takes into account both the static weights of the links and the queue lengths.
  • Backward Learning: In this method the routing tables at each node gets modified by information from the incoming packets. One way to implement backward learning is to include the identity of the source node in each packet, together with a hop counter that is incremented on each hop. When a node receives a packet in a particular line, it notes down the number of hops it has taken to reach it from the source node. If the previous value of hop count stored in the node is better than the current one then nothing is done but if the current value is better then the value is updated for future use. The problem with this is that when the best route goes down then it cannot recall the second best route to a particular node. Hence all the nodes have to forget the stored informations periodically and start all over again.
Distributed: In this the node receives information from its neighbouring nodes and then takes the decision about which way to send the packet. The disadvantage is that if in between the the interval it receives information and sends the paket something changes then the packet may be delayed. Non-Adaptive Routing Algorithm: These algorithms do not base their routing decisions on measurements and estimates of the current traffic and topology. Instead the route to be taken in going from one node to the other is computed in advance, off-line, and downloaded to the routers when the network is booted. This is also known as static routing. This can be further classified as:
  1. Flooding: Flooding adapts the technique in which every incoming packet is sent on every outgoing line except the one on which it arrived. One problem with this method is that packets may go in a loop. As a result of this a node may receive several copies of a particular packet which is undesirable. Some techniques adapted to overcome these problems are as follows:
  • Sequence Numbers: Every packet is given a sequence number. When a node receives the packet it sees its source address and sequence number. If the node finds that it has sent the same packet earlier then it will not transmit the packet and will just discard it.
  • Hop Count: Every packet has a hop count associated with it. This is decremented(or incremented) by one by each node which sees it. When the hop count becomes zero(or a maximum possible value) the packet is dropped.
  • Spanning Tree: The packet is sent only on those links that lead to the destination by constructing a spanning tree routed at the source. This avoids loops in transmission but is possible only when all the intermediate nodes have knowledge of the network topology.

Flooding is not practical for general kinds of applications. But in cases where high degree of robustness is desired such as in military applications, flooding is of great help.

  1. Random Walk: In this method a packet is sent by the node to one of its neighbours randomly. This algorithm is highly robust. When the network is highly interconnected, this algorithm has the property of making excellent use of alternative routes. It is usually implemented by sending the packet onto the least queued link.
User Avatar

Wiki User

10y ago

What else can I help you with?

Related Questions

Difference between adaptive and non adaptive algorithm?

Non adaptive algorithm requires any changes to be made manually. Adaptive algorithms are able to make any changes automatically.


What is the difference between adaptive and nonadaptive coping mechanisms?

Adaptive coping mechanisms involve actively addressing and managing stressors in a healthy and effective manner that promotes long-term well-being. Nonadaptive coping mechanisms involve avoiding or suppressing stressors in ways that may provide temporary relief but are harmful in the long run. Adaptive coping strategies help individuals to better manage stress and build resilience, while nonadaptive coping strategies can lead to negative consequences for mental and physical health.


What is the difference between assistive and adaptive bio engineered products?

Adaptive changes the object and assistive helps it without changing it


What is the difference between assistive and adaptive bioengineering?

Assistive helps someone while adaptive changes someone. ex. A rod on a broken leg is adaptive when contacts are assistive.


What is the difference between adaptive and perfective maintenance?

Adaptive maintenance is where the programmer modifies existing software to suit new tasks.Perfective maintenance, on the other hand, is where the programmer modifies software to make it perform better.


What is the difference between inter domain routing and intra domain routing and what are they for?

Routing algorithms that are restricted to only work within the domain are referred as intera-domain routing algorithms and if they are not restricted only within the domains then they are inter-domain algorithms.


What are the two names of the most popular hashing algorithms?

Both SHA-1 and MD5 are good hashing algorithms. The primary difference between the two is speed; MD5 is faster to process than SHA.


What are the differences between the Edmonds-Karp and Ford-Fulkerson algorithms for solving the maximum flow problem?

The main difference between the Edmonds-Karp and Ford-Fulkerson algorithms is in how they choose the augmenting paths to increase the flow in the network. Edmonds-Karp uses breadth-first search to find the shortest augmenting path, while Ford-Fulkerson can use any path. This difference affects the efficiency and running time of the algorithms.


What is the difference between an algorithm and flow chart WITH examples?

An algorithm is a method of solving a problem. A flow chart is a tool for visualizing algorithms.


What is the difference between the time complexity of algorithms with a runtime of n and log n?

The time complexity of algorithms with a runtime of n grows linearly with the input size, while the time complexity of algorithms with a runtime of log n grows logarithmically with the input size. This means that algorithms with a runtime of n will generally take longer to run as the input size increases compared to algorithms with a runtime of log n.


Difference between function and recursive variable?

A function can map for sets with infinite elements. Recursive variables, being 'algorithms of algorithms', are restricted to finite elements.


What is the difference between pseudocode and trace table?

pseudocode is a sentence-like representation of a piece of code while a trace table is a technique used to test a algorithms.