Downloaded 219 times
More Related Content
Similar to Distance Vector Routing Protocols
More from KABILESH RAMAR
Distance Vector Routing Protocols
- 1. TRADITIONAL ROUTING PROTOCOLS DISTANCE VECTORROUTING (DV)
- 2. DEFINITION Distance is ameasure of number of Hops the Packet requires to reach the Destination. Here Vector is defined as (Distance, Direction) next Hop router to which the packet is to be forwarded. It is also known as Bellman Ford Algorithm.
- 3.
- 4. EXPLANATION In Distance VectorRouting Protocol, each node shares its routes in the network only to the neighbors and does not broadcast it. (not to all) Whenever any node receives the Routing Information it updates its own routing table and inform to its neighbors.
- 5. WORKING PRINCIPLE 1) Firstlyeach node enters the cost of the neighboring node 2) A link that is down (not a direct neighbor) is assigned a cost is assigned to Infinity
- 6. WORKING PRINCIPLE 3) Everynode that sends a message directly connected to the adjacent node about the adjacent neighbors and their cost. 4) After exchanging the nodes information it will find the least cost to reach the other nodes information.
- 7. DRAWBACKS OF DISTANCEVECTOR 1) COUNT TO INFINITY PROBLEM. 2) SPLIT HORIZON
- 8. Count to infinityproblem
- 9. Split Horizon In thiscase, node A keeps the value of infinity as the distance to X. Later when node A sends its routing table to B, node B also corrects its routing table. The system becomes stable after the first update. In our scenario, node B eliminates the last line of its routing table before it sends it to A
- 10. Split Horizon withPoison Reverse Split Horizon and Poison Reverse Using the split horizon strategy has one drawback. Node B can still advertise the value for X, but if the source of information is A, it can replace the distance with infinity as a warning: "Do not use this value; what I know about this route comes from you."
- 11.
- 12. DEFINITION In link staterouting, if each node in the domain has the entire topology of the domain the list of nodes and links, how they are connected including the type, cost (metric).
- 13.
- 14. EXPLANATION Node A knowsthat it is connected to node B with metric 5, to node C with metric 2,and to node D with metric 3. Node C knows that it is connected to node A with metric 2,to node B with metric 4, and to node E with metric 4. Node D knows that it is connected only to node A with metric 3. And so on.
- 15.
- 16.
- 17. EXPLANATION Link State Advertisementis used by all the Routers to know the cost information of all Routers participate in the network. Link State Packet Database is used to store the Routing table entries. Each node participating in the network will have identical Link State Packet Database.
- 18. EXPLANATION One of theCharacteristics of Link State Protocol is every node constructs a graph about the connectivity of adjacent nodes. After the graph is drawn, shortest path is calculated to reach the destination.
- 19. PROS OF LINKSTATE ROUTING 1) Scalability is not an issues in this. 2) Whenever more than 100 routers are employed link state routing is used.
- 20. CONS OF LINKSTATE ROUTING 1) It contain more CPU utilization 2) It is more difficult to configure and maintain ( because more number of routers are going to be employed)