Non-Adaptive Routing Algorithm: These algorithms do not base their routing decisions on measurements and estimates of the current traffic and topology. As an alternative 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 called as static routing. This could be further classified as follows:
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 trouble with this method is that packets may go in a loop. As a result of this a node may gets several copies of a particular packet which is undesirable. Some techniques adapted to defeat these problems are as follows:
§ Sequence Numbers: Every packet is given a sequence number. When a node gets 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 0 (or a utmost possible value) the packet is dropped.
§ Spanning Tree: In this The packet is sent only on those links that lead to the destination by developing a spanning tree routed in the direction of the source and This prevents loops in transmission but is likely only when all the intermediate nodes have information of the network topology.
Flooding is not practical for common kinds of applications. But in cases where high degree of toughness is desired such as in military applications, flooding is of enormous help.
2. Random Walk: In this scheme a packet is sent by the node to one of its neighbours arbitrarily. This algorithm is extremely robust. When the network is extremely interconnected and this algorithm has the property of making excellent use of substitute routes. It is typically implemented by sending the packet onto the slightest queued link.
Email based Computer Science assignment help - homework help at Expertsmind
Are you searching Computer Science expert for help with Non-Adaptive Routing Algorithm questions? Non-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 Non-Adaptive Routing Algorithm related problems. We provide step by step Non-Adaptive Routing Algorithm question's answers with 100% plagiarism free content. We prepare quality content and notes for Non-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