What is the difference between distance Vector and LINK –state? Introduction Router to be able to route the Packets needs to know the following information. To route a packet, a router needs to know:
Sources it can learn from
Maintain and Verify the routing information
The basic features of a routing protocol are as follows
: Administrative distance: value that ranking the routes
: Information used to select the best path for routing
. There are three classes of routing protocol:
distance Vector Routing Protocol such as RIPv2.
Link State Routing Protocol such as OSPF
Hybrid Routing Protocol such as EIGRP distance Vector Routing
1 Distance means how far
and Vector means in which direction
. distance Vector
routing protocols pass periodic copies of routing table to neighbors routers and accumulate distance
vectors. In distance Vector
routing protocols, routers discover the best path to destination from each neighbors. The routing updates proceed step by step from router to router
vs. Link State Routing Protocol There are two major differences between distance Vector routing protocols and Link State routing protocols
exchanges the routing updates periodically whether the topology is change or not.
This will maximize the convergence time which increases the chance of routing loops.
Link State routing protocols send triggered change based updates when there is a topology change.
After initial flood, pass small event based triggered link state updates to all other routers. This will minimize the convergence time.
Secondly, the distance Vector
routing protocols rely on the information from their directly connected neighbours in order to calculate and accumulate route information.
routing protocols require very little overhead as compared to Link State routing protocols as measured by memory and processor power while the Link State routing protocols do not rely solely on the information from the neighbours or adjacent router in order to calculate route information.
Instead, Link State routing protocols have a system of databases that they use in order to calculate the best route to destinations in the network.
An extra feature of Link State routing protocol is that they can detect media types along with other factors. This could increase the overhead as compare to distance Vector
routing protocols in order to measure by processor power and memory. Routing Information Protocol (RIP) and Interior Gateway Routing Protocol (IGRP) are the examples of Distance
Vector routing protocols while the Open Shortest Path First (OSPF) is a classic example of Link State routing protocols.
routing protocols are based on Bellma and Ford algorithms.
routing protocols are less scalable such as RIP supports 16 hops and IGRP has a maximum of 100 hops.
are classful routing protocols which means that there is no support of Variable Length Subnet Mask (VLSM) and Classless Inter Domain Routing (CIDR).
routing protocols uses hop count and composite metric.
routing protocols support dis-contiguous subnets.
Link State routing protocols are based on Dijkstra algorithms.
Link State routing protocols are very much scalable supports infinite hops.
Link State routing protocols are classless which means that they support VLSM and CIDR.
Cost is the metric of the Link State routing protocols.الموضوع الأصلى من هنا: منتديات سيسكو التعليمية | كن بين الخبراء ! http://www.ciscovb.com/vb/t4148.html#post24435
Link State routing protocols support contiguous subnets.
Problem with distance
The routing loops have been occurred.
It is because the distance Vector
routing protocols send periodic routing updates and each node maintain the distance
from itself to each possible destination network, for this the convergence time of distance Vector
routing protocols is slow.
Slow convergence produces inconsistent routing.
When the topology of network changes and a network has gone down, the packets for the network bounce between
routers and the hop count for specific network counts to infinity, the solution is split horizon.
Split horizon follows the rule that it is never useful to send information about a route back in the direction from which the original packet came. Split horizon can be disabled for all distance Vector
The rule of split horizon can cause routing table update problems on a hub and spoke frame-relay topology.
The rule of split horizon is applied at the network layer with distance Vector
routing protocols. distance Vector
routing protocols have no awareness of the multi-connection and they do not know that routing information may arrive on one frame relay PVC on a physical interface and need to go out other PVCs on the same physical interface
5 Summary about the difference between distance Vector & Link State
• Entire routing table is sent as an update
• distance Vector
protocol send periodic update at every 30 or 90 second
• Update are broadcasted
• Updates are sent to directly connected neighbor only
• Routers don't have end to end visibility of entire network.
• distance Vector
routing protocol network may have xxxxx in network
carrying wrong information
• It is proned to routing loops
• Routing loop avoidance Mechanism used are as below :
1> Max Hop Count
2> Spliti horizon
3> Route poisoning
4> Hold down Timer
• distance Vector
routing protocol has slow convergance due to periodic
• Eg. RIP ,IGRP , BGP .
6 Link state protocol:
• Updates are incremental & enitire routing table is not sent as update
• Updates are triggered not periodic
• Updates are multicasted
• Update are sent to entire network & not to just directly connected
• Updates are carry SPF tree information & SPF cost Calculation information
of entire topology
• Routers have visibility of entire network of that area only.
• No routing loops
• Convergance التقارب is fast because of triggered updates.
• Eg. : OSPF , IS-IS
what is the difference between distance Vector and Link-state distance link-state