59-Routed+Protocols
59-Routed+Protocols
o Routed protocols are the actual data that is transferred from router to router.
o Examples of routed protocols are Internet Protocol (IP) such as IPV4 and IPV6.
o Routed Protocol is used to send user data from one network to another network.
o Routed Protocol carries user traffic such as e-mails, file transfers, web traffic etc.
o Used between routers to direct user traffic, it is also called network protocols.
o That are signs at intersections that point to nearby cities, giving mileage to each.
Routing Protocols:
o Routing protocols are used by routers to exchange information about known networks.
o Routers will initially only know the existence of directly connected or attached networks.
o With the use of routing protocols routers communicate with & learn from other routers.
o Routing protocols are used to distribute routing information across routers on a network.
o Routing protocol is Google Maps: It tells you the best way to get where you want to go.
Routed Protocol Routing Protocols
IP, IPV4, IPV6 RIPV1, RIPV2, OSPF, EIGRP, BGP,ISIS
Default Routing:
o A Default Route also known as the gateway of last resort is a special type of static route.
o This method where all routers are configured to send all packets towards single router.
o Default Route is Network Route used by router when there is no other known route exists.
o All the IP datagrams with unknown destination address are sent to the default route.
Dynamic Routing:
o Dynamic routing protocols can dynamically respond to changes in the network.
o Routing protocol is configured on each router & router learn about both each other.
o Dynamic routing table is created, maintained and updates by the routing protocol.
o Examples of routing protocols includes RIPV1, RIPv2, ISIS, EIGRP, and OSPF and BGP.
o Dynamic routing protocols share routing updates with neighbors and find best path.
o Dynamically choose a different route if a link goes also Updates are dynamically.
o Also, Dynamic Protocols has the ability to load balance between multiple links.
o Dynamic Routing protocols put additional load on the Router CPU and RAM.
o The choice of the best route is on the hands of the dynamic routing protocol.
Distance Vector:
o Distance vector routing protocol uses distance (metric value) and direction (vector).
o Distance Vector use distance and vector to find the best path to destination network.
o In Distance Vector routing router receives routing update from neighboring router.
o In distance vector neighboring routers receive updates from their neighboring routers.
o In this way, distance vector routing protocol work until the destination network.
o In Distance Vector routing, every router in the way of destination network called hop.
o Each time a packet goes through a router, it adds one in hop count value or number.
o Route with least hop count value chosen as best path & will be placed in routing table.
o RIP version 1 and RIP version 2 is the example of distance vector routing protocol.
o These protocol shares entire routing table to the directly connected neighbors.
o Distance Vector Routing Protocols are slow and have a chances for loops.
o Distance means (How far Away) and Vector means (Which Direction).
Link State:
o As compare to distance routing Link State Routing Protocols operate differently.
o Routers send information about the state of their links to the entire network or area.
o In this way, in Link State Routing each router understands the entire network topology.
o Run algorithm every time network change is announced to recalculate best routes.
o As compare to other Link State Routing Protocols much more processor intensive.
o Link State Routing Protocols only send triggered updates not periodic updates.
o Link State Protocols maintain three separate tables Neighbor, Topology & Routing Table.
Protocols Metric
Static Administrator decides
OSPF Cost
RIP Hop Counts
EIGRP Bandwidth and Delay
BGP Path Counts
Administrative Distance:
o Administrative distance is the feature that routers use to select best path.
o Administrative Distance (AD) defines the reliability of a routing protocol.
o The administrative Distance (AD) number is start from 0 and end on 255.
o AD has only local significance and is not advertised in the routing updates.
o The smaller the administrative distance value, the more reliable the protocol.
o Router is running multiple routing protocols; AD is to determine trustable protocol.
o Routing Protocol with lowest Administrative Distance (AD) wins put in routing table.
Route Source Default Administrative Distance
Connected Interfaces 0
Static Route 1
EIGRP Summary 5
External BGP 20
EIGRP 90
OSPF 110
IS-IS 115
RIP 120
External EIGRP 170
Internal BGP 200
Unknown 255
Permanent:
When a route goes down router will remove that from routing table. Permanent parameter will
keep this route in routing table even if it goes down. use this parameter for security reason if
you never want packets to take another path.