Adaptive Routing Algorithm: These algorithms change their routing decisions to reflect changes in the topology and in traffic as well. These obtain their routing information from nearby routers or from all routers. The optimization parameters can be the distance, number of hops and at last estimated transit time and 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, regarding the traffic and about other nodes. Now, then transmits this information to the respective routers. The benefit of this is that only 1 node is required to keep the information. The drawback is that if the central node goes down the entire network is down that is single point of failure.
2. Isolated: In this scheme the node decides the routing without looking for information from other nodes. The sending node does not know about the status of a particular connection. The drawback is that the packet may be send through a crowded route resulting in a delay. Some ex. of this type of algorithm for routing are these:
§ Hot Potato: When a packet comes to a node, it tries to get free of it as fast as it can, by putting it on the shortest output line up without regard to where that link leads. A distinction of this algorithm is to combine static routing with the hot potato algorithm. In this,When a packet arrives, the routing algorithm takes into description 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 method to implement backward learning is to include the identity of the source node in every packet, jointly with a hop counter that is incremented on each hop. When a node gets a packet in a particular row, it notes down the no.r of hops it has taken to arrive at it from the source node. If the preceding value of hop count stored in the node is healthier than the current one then nothing is done but if the present value is better then the value is updated for future use. The difficulty with this is that when the best route goes down then it cannot recall the 2nd best route to a particular node. Hence every the nodes have to forget the stored informations from time to time and start all over again.
3. Distributed: In this the node receives information from its neighboring nodes and then takes the decision about which way to send the packet. The drawback is that if in among the the interval it receives information and sends the packet a little changes then the packet can be delayed.
Email based Computer Science assignment help - homework help at Expertsmind
Are you searching Computer Science expert for help with Adaptive Routing Algorithm questions? Adaptive Routing Algorithm topic is not easier to learn without external help? We at www.expertsmind.com offer finest service of Computer Science assignment help and computer science homework help. Live tutors are available for 24x7 hours helping students in their Adaptive Routing Algorithm related problems. We provide step by step Adaptive Routing Algorithm question's answers with 100% plagiarism free content. We prepare quality content and notes for Adaptive Routing Algorithm topic under computer science theory and study material. These are avail for subscribed users and they can get advantages anytime.
Why Expertsmind for assignment help
- Higher degree holder and experienced experts network
- Punctuality and responsibility of work
- Quality solution with 100% plagiarism free answers
- Time on Delivery
- Privacy of information and details
- Excellence in solving computer science questions in excels and word format.
- Best tutoring assistance 24x7 hours